Assume that you have a guessLuckyInt function, which takes no arguments and non-deterministically produces a 32-bit int in constant time by calling makeGuess 32 times. It therefore always returns, if possible, a value that will ultimately cause success to be executed . Write a non-deterministic main program in C (enhanced with success and guessLuckyInt) that sorts an array of int in O(n) time (yes, that's linear time) and prints the result to standard output. Assume that a function getArray (which takes no parameters) is available, which creates and returns the (pointer to the) array for you to sort; the function getArraySize (also taking no parameters) tells you the number of elements in the array.
Assume that you have a guessLuckyInt function, which takes no arguments and non-deterministically produces a 32-bit int in constant time by calling makeGuess 32 times. It therefore always returns, if possible, a value that
will ultimately cause success to be executed . Write a non-deterministic main program in C (enhanced with success and guessLuckyInt) that sorts an array of int in O(n) time (yes, that's linear time) and prints the result to standard output. Assume that a function getArray (which takes no parameters) is available, which creates and returns the (pointer to the) array for you to sort; the function getArraySize (also taking no parameters) tells you the number of elements in the array.
Step by step
Solved in 4 steps with 6 images