Given a string of random length and random contents of characters, that do not include digits...

 

Transcribed Image Text:

Given a string of random length and random contents of characters, that do not include digits (0-9), write an algorithm, using pseudo code that will shorten the representation of that string by adding the number of consecutive characters. For instance, given str as "gggN@@@@@KKeeeejjdsmmu the algorithm should return the following representation of the string: "g3N@5K2e4j2dsm2u. a) What is the time complexity of your algorithm, in terms of Big-O? b) What is the space complexity of your algorithm, in terms of Big-O? Given a string of random length and random contents of characters, that do not include digits (0-9), write an algorithm, using pseudo code that will shorten the representation of that string by adding the number of consecutive characters. For instance, given str as "gggN@@@@@KKeeeejjdsmmu the algorithm should return the following representation of the string: "g3N@5K2e4j2dsm2u. a) What is the time complexity of your algorithm, in terms of Big-O? b) What is the space complexity of your algorithm, in terms of Big-O?