Consider an array of size eight with the numbers 30, 80, 50, 60, 20, 10, 70, 40. Assume you execute quicksort using the version of partition from CLRS. [Note that an element can exchange with itself, (which counts as one exchange)Required:a. Show the array after the first partition. How many comparisons are used? How many exchanges? b. Show the left side (of the original pivot) after the next partition. How many comparisons are used? How many exchanges? c. Show the right side (of the original pivot) after the next partition on that side. How many comparisons are used? How many exchanges?

3. (5 points) describe what would be printed by the code below or what error would occur. const char* cstr = "0123456"; const char* ptr = & cstr[4]; cout < < ptr[-1] < < ptr < < endl; 1 4. (5 points) theseus has been trapped in a maze with a minotaur, which is trying to capture him. each round, theseus and the minotaur move through the maze; theseus towards the exit, and the minotaur towards theseus. theseus can move in any of the four cardinal directions, or he can wait for a round to see how the minotaur moves. write code that creates a data type to represent the possible moves that theseus could make.

What is a society that has moved to the internet rather than relying on physical media called

Why the bear has a slunky tail determine the meaning of the word slunk in the story