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.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

IN C++ You have given an array aa of length n and an integer x to a brand new robot. What the robot does is the following: it iterates over the elements of the array, let the current element be q. If q is divisible by x, the robot adds x copies of the integer q/x to the end of the array, and moves on to the next element. Note that the newly added elements could be processed by the robot later. Otherwise, if q is not divisible by x, the robot shuts down. Please determine the sum of all values of the array at the end of the process. Input The first input line contains a single integer tt (lâ%oatâ%o¤100) â€" the number of test cases. The first line of each test case contains two integers n and x (1â%o¤nâ%o010^5, 2â%oaxâ%o ¤10^9) â€" the length of the array and the value which is used by the robot. The next line contains integers al, a2, .., an (lâ%o¤aiâ%o¤1O^9) â€" the initial values in the array. It is guaranteed that the sum of valuesn over all test cases does not exceed 10^5 Output For…
Implement the vacuum cleaning agent function in Python/Java for the scenario described below: Consider two-dimensional Boolean array of size m x n (m and n can each be equal to 4) where m is the number of rows, and n is the number of columns. Obtain numerical positive integer values for m and n as inputs from the user. Generate random numbers and scale them down to either a “0” or a “1” according to whether they represent “Clean” or “Dirty”, respectively. After filling the array with 0s or 1s, start at some random array position indicating the initial position of the vacuum cleaner. First check if at that current position, there is the presence of a “Dirt” or not determined by whether 0 or 1 is filled in at that initial position of the vacuum cleaner. If there is a “Dirt”, clean it, and if there is no “Dirt” do a No-operation. After this is done, generate random numbers modulo 4 to obtain random numbers 0, 1, 2, 3 indicating whether to take a left, right, up or down correspondingly. If…
Write a C++ program that declares and initializes an integer array of size 100 with randomintegers between 1 and 10 inclusive using initializeArray (from question 1) and counts the occurrence of eachnumber in the array and graphs the information in the form of a bar chart or histogram—each number isprinted, then a bar consisting of that many asterisks is printed beside the number.Here is a sample run of the program:Number Value Histogram1 12 ************2 5 *****3 3 ***4 16 ****************5 7 *******6 6 ******7 9 ********8 1 *9 15 *************** 10 10 **********
Write a c++ program to declare an array of odd number of elements. Split it into the middle and store the elements in two different arrays. e.g. Initial array: 22 58 19 87 15 72 9 1 37 After splitting: 22 58 19 87 15 72 9 1 37 As output, your code should print the original and the two split arrays, each element separated by the comma sign. Your code should be generic enough to also work for arrays with an even number of elements.
In c++, Thanks!!! Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. You will need to define one other helper function (IsPrimeRecur) for the recursion which should also not contain any loops to make it a…
By using c++ .. Given an array of size n, each element contains either a 'P' for a policeman or a 'T' for athief. Find the maximum number of thieves that the police can catch.Keep in mind the following conditions:1. Each policeman can catch only one thief.2. A policeman cannot catch a thief who is more than K units away from him. Example 1:Input:N = 5, K = 1arr[] = {P, T, T, P, T}Output: 2Explanation: Maximum 2 thieves can be caught. The first policeman catches the first thiefand the second policeman can catch either the second or third thief. Example 2:Input:N = 6, K = 2arr[] = {T, T, P, P, T, P}Output: 3Explanation: Maximum of 3 thieves can be caught.
Please give code in C language. no screenshots please please. For this assignment, you need to study the performance of 2 designed algorithms using different logic. You need to write a program that takes N (size of input) then write the following functions/methods: int[] GenerateValues (N) where N is random int values between 0 and N-1. DistinctValues Algorithms: int findDistintValuesWithoutSort( A, N) to count the number of distinct values in A without sorting algorithm. int findDistintValuesWithSort( A, N) to count the number of distinct values using any sorting algorithm (i.e., quicksort or merge sort or heapsort). Print the execution time for each method to find the distinct values where N = 103, 104, and 105. Note the execution time in a table and discuss your results in the document file. Discuss the execution time compared to your big -O analysis of the 2 DistinctValues algorithms.
Implement the following scenario using C++. Ibri City Polyclinic wishes to maintain their doctor details such as doctor id, name, and their specialization (Example: General / Pediatrician / El Specialist / Artho / Neurologist) in an array. Kindly help the hospital authorities to read the doctor details in an ascending order based on doctor id, store it in an array and search any given doctor id in the array using binary search. If the searched doctor id is found, then display only doctor name and their specialization otherwise display ' This doctor is not working in our hospital '. Note: 1. Use your name as the name of the structure. 2. Maximum number of account holders 25o
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
create a function named powerHalf(x, n), where this function is recursive like power(x, n), but it also uses the idea that xn = (x n/2)2 when n is even. Use the global variable countcalls to verify that this version of the power function is more efficient than power(x,n), where n is 0 or a positive integer with the base case that: xn = x * xn-1 use python please
Write a program in C++ that can perform encryption and decryption using an arbitrary substitution cipher. In this case, the encrpyion array is a random shuffling of the letters in the alphabet. Your program should generate a random encryption array, its corresponding decryption array, and use these to encode and decode the message.
Write a C++ Program that reads a sentence from a file "Sentence.txt" in an array. it also takes input a word "Find" to find and a word "insert" to insert in array. Your task is to find the word and insert the word entered by user in array next to the word found. For Example: Array: The quick brown fox jumps over lazy dog's back. Enter word to find: quick Enter word to insert after: slim After inserting the word updated array is Array: The quick slim brown fox jumps over lazy dog's back