How to resolve the algorithm Run-length encoding step by step in the Bracmat programming language

Published on 12 May 2024 09:40 PM
#Bracmat

How to resolve the algorithm Run-length encoding step by step in the Bracmat programming language

Table of Contents

Problem Statement

Given a string containing uppercase characters (A-Z), compress repeated 'runs' of the same character by storing the length of that run, and provide a function to reverse the compression. The output can be anything, as long as you can recreate the input with it.

Note: the encoding step in the above example is the same as a step of the Look-and-say sequence.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Run-length encoding step by step in the Bracmat programming language

Source code in the bracmat programming language

  ( run-length
  = character otherCharacter acc begin end
    .   :?acc
      & 0:?begin
      & @( !arg
         :   ?
             [!begin
             %@?character
             ?
             [?end
             (   (%@:~!character:?otherCharacter) ?
               & !acc !end+-1*!begin !character:?acc
               & !otherCharacter:?character
               & !end:?begin
               & ~`
             | &!acc !end+-1*!begin !character:?acc
             )
         )
      & str$!acc
  )
&   run-length$WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWBWWWWWWWWWWWWWW

You may also check:How to resolve the algorithm Reverse a string step by step in the Rust programming language
You may also check:How to resolve the algorithm 9 billion names of God the integer step by step in the J programming language
You may also check:How to resolve the algorithm Hough transform step by step in the Haskell programming language
You may also check:How to resolve the algorithm Order two numerical lists step by step in the REXX programming language
You may also check:How to resolve the algorithm Zeckendorf arithmetic step by step in the Haskell programming language