Representing algorithms

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748
Question 23
Easy

An algorithm is being developed to compress a sequence of pixel data using Run-Length Encoding (RLE).

Below is the pseudocode representation of the algorithm:

pixels ← "AAABBC"
i ← 0
run_length ← 1
WHILE i < LEN(pixels) - 1
    IF pixels[i] C1 pixels[i + 1] THEN
        OUTPUT run_length
        OUTPUT pixels[i]
        run_length ← 1
    ELSE
        run_length ← run_length + 1
    ENDIF
    i ← i + 1
ENDWHILE
OUTPUT run_length
OUTPUT pixels[i]

Which comparison operator should be placed at C1 for the algorithm to work correctly?

===

<<<

≠\ne=

>>>

Representing algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Representing algorithms