1. Joe Pancake has just invented what he thinks is a great sorting algorithm. Consider the followingcode:/*** Returns index of the maximum element in array[0..n-1].*/int find_max(int array[], const int length) {int max_index, i;for (max_index 0, i=0; i < length; ++i) {if (array[i]> array[max_index]) {max_index =}}return max_index;}}/*** Reverses array [0..limit].*/void flip(int array[], int limit) {int temp, start = 0;while start < limit)array[start];}tempi;=array[start] = array[limit];array[limit]= temp;start++;limit--;}void pancake_sort(int array[], const int length) {for (int curr_size length; curr_size > 1; --curr_size) {int max_index find_max(array, curr_size);if (max_index != curr_size-1) {}flip(array, max_index);flip(array, curr_size-1); Show the array [2, 4, 1, 5. 31 after the for loop in pancake_sort executes once.What is the best-case complexity of the pancake_sort algorithm above including helper functions?What is the worst-case complexity of the pancake_sort algorithm above including helper functions?Which of the elementary sorting algorithms discussed in class is closest to (but not exactly the sameas) what Joe has written? Use the complexities to guide your response. Circle your answerbubble / selection / insertion

Define find_max function:Initialize max_index to 0.Iterate through the array from index 0 to length…

Show the array [2, 4, 1, 5. 31 after the for loop in pancake_sort executes once. What is the best-case complexity of the pancake_sort algorithm above including helper functions? What is the worst-case complexity of the pancake_sort algorithm above including helper functions? Which of the elementary sorting algorithms discussed in class is closest to (but not exactly the same as) what Joe has written? Use the complexities to guide your response. Circle your answer bubble / selection / insertion

Show the array [2, 4, 1, 5. 31 after the for loop in pancake_sort executes once. What is the best-case complexity of the pancake_sort algorithm above including helper functions? What is the worst-case complexity of the pancake_sort algorithm above including helper functions? Which of the elementary sorting algorithms discussed in class is closest to (but not exactly the same as) what Joe has written? Use the complexities to guide your response. Circle your answer bubble / selection / insertion

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Java program
Complete the following function definition to recursively print the index of a unique value in an array or -1 if the value is not found:1 int getIndex(int *a, int s, int v) {2 if( ) { // if no values are found3 4 }5 if(a[s-1] == v) { // if a value is found6 7 }8 return getIndex( ); // recurse to check next value9 }Hint:Recurse through the array by counting down from size. 1. Complete the one line of code for line 2:2. Write one line of code for line 3:3. Write one line of code for line 6:4. Complete the one line of code for line 8: please send an atom code. not other software
public int[] bubbleSort(int[] array) {int n = array.length;int temp = 0;}
erfd
using java programming int a[] = {5,10,4,20,1,7}; 1- search for the smallest element in array 2-if you found the smallest element in the array :swap the first element with the smallest element
int[] cars = {1,2,3,4,5}; for (int i=0; i
int g(int nums[], int n) { if (n == 1) return 0; int val = g(nums, n-1); if (nums[n-1] > nums[val]) return val; return n-1; } Give a recurrence T(n) for the number of times the code nums[n-1] > nums[val] is executed when the array values are in ascending order. Then solve the recurrence
12. Dry run with this code that will take values 8,7,2,5,3 and mention the name of the algorithms. void Sort(int numbers[ ], int array_size) { int i, j; int min, temp; for (i = 0; i< array_size-1; i++) { min = i; for (j = i+1; j< array_size; j++) { if (numbers[j] < numbers[min]) min = j; } temp = numbers[i); numbers[i] = numbers[min]; numbers[min] = temp; }
9).An array of integers nums sorted in ascending order, find the startingand ending position of a given target value. If the target is not found in thearray, return [-1, -1]. For example:Input: nums = [5,7,7,8,8,8,10], target = 8Output: [3,5]Input: nums = [5,7,7,8,8,8,10], target = 11Output: [-1,-1]. Please weite your Code.
CodeWorkout X263: Recursion Programming Exercise: Largest Write the missing base case for function largest.Function largest should find the largest number in array numbers.When largest is first called, index will equal numbers.length-1. Examples: largest({2, 4, 8}, 2) -> 8 Your Answer: 1 public int largest(int[] numbers, int index) { if > return numbers[0]; return Math.max(numbers[index], largest(numbers, index-1)); 5} 4
In main() for now: do these - one at a time, each in it's own loop (we will make functions out of them later –Declare an array RandArray with 20 integers –Assign each of the 20 values with a random value from 0 to 99 Hint: Use rand()%100 For mimir: Do not call srand at the top of main. // normally: Call srand(time(0)) at the top of main –(you need #include<cstdlib>) –Write another loop that prints the array, with index values Important: If the output values do not match mimir, please add srand(17); // inside your main function - at the top code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){ srand(17); // define a constant ARRAYSIZE that is 20 // declare randArray // set the 20 elements in randArray to be a random number between 0 and 99 // hint: use rand()%100 // print the 20 values return 0;}
C++