Output the execution time for the quick sort, selection sort, insertion sort, bubblesort, and merge sort algorithms as they attempt to sort an array of 1000 randomnumbers, 1000 sorted number, and 1000 numbers in reversed order.For this use the the high_resolution_clock::now() function that will return the currenttime. To use this you will also need to include the header file as well asusing namespace std::chrono.Quick sort187 ms for random numbers176 ms for sorted numbers173 ms for reversed numbersSelection sort1300 ms for random numbers1424 ms for sorted numbers2578 ms for reversed numbersInsertion sort401 ms for random numbers1 ms for sorted numbers1 ms for reversed numbersBubble sort1366 ms for random numbers669 ms for sorted numbers667 ms for reversed numbersMerge sort1297 ms for random numbers1049 ms for sorted numbers1010 ms for reversed numbers

Let's break down the code step by step:Include necessary libraries: We include <iostream> for…

Answered: Output the execution time for the quick…

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

In C program language, You are to read 10 numbers from a data file into an array named List. Create another 10 element array named Reverse that is to contain the same items as List but in reverse order. For example, the first element in List will be placed in the last position of Reverse, the second element in List will be placed in the second-to-last position in Reverse, etc. After Reverse has been created, output the contents of both arrays.
In cell C18 type a VLOOKUP function to find the corresponding letter grade (from column D) for the name in A18. The table array parameter is the same as in B18. Type FALSE for the range lookup parameter. Copy the formula in C18 to C19:C22Notice this formula works correctly for all cells. Range lookup of FALSE means do an exact match on the lookup value whether or not the table array is sorted by its first column. In cell E11, type an IF function that compares the score in B11 with the minimum score to pass in A5. If the comparison value is true, display Pass. Otherwise, display Fail. Copy the formula in E11 to E12:E15. Did you use appropriate absolute and relative references so the formula copied properly? In cell F11, type an IF function that compares the grade in D11 with the letter F (type F). If these two are not equal, display Pass. Otherwise, display Fail. Copy the formula in F11 to F12:F15
In Quick Sort, the function Partition is used to arranged the values into the S1 set and S2 set based on the pivot value. Given the following array, what is the content of the array after the function Partition finished the 1st pass assuming the pivot value is 40? array: 44 12 50 3 40 23 Question 4 options: 3 12 23 40 44 50 12 3 23 40 44 50 40 12 3 50 44 23 23 12 3 40 44 50
PLEASE DO THIS IN PYTHON Part 4 - Performance of binary_search Modify your binary_search function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the True or False result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Test Code max_elements = 100000 for length in range(1, max_elements, 10000): values = list(range(1, (2 * length) + 1, 2)) num_comparisons, found = binary_search(values, length + 1, 0, len(values) - 1) num_comparison_string = format(num_comparisons, '03d') print(num_comparison_string, '*' * (num_comparisons // 10))
Write a function which creates an array with size 25 in range [0,100] . Sort this array by using bubble sort. Also create an decorater for this function to meausure its execution time.
Using the supplied main.cpp, help me add code for the reverseNames() function. The function should accept two arrays that are parallel, and reverse the order of the strings in the array. Because the arrays are parallel, the elements should be swapped at the same time. Do not swap the pets array, then the owner array in separate loops. Do it all in a single loop in the function. Prototypes void reverseString( string a[ ], b[ ], int size ); Function reverseString() will reverse the order of the strings in the arrays. The following is the main.cpp #include <iostream> using namespace std; void reverseNames( string [], string [], int size); int main(){ string pet[5] = {"Hobbs", "Snoopy", "Odie", "Garfield", "Pluto"}; string owner[5] = {"Calvin", "Charlie", "Jon", "Jon", "Mickey"}; cout << "Initial array values" << endl; for ( int i=0; i<5; i++){ cout << pet[i] << " " << owner[i] << endl; } reverseNames(pet, owner, 5); cout << endl <<…
Rewrite the function pfind which searches an array for a specific value, and returns a pointer to the value in the array (if found), and nullptrif not. Instead of using a loop, use the standard algorithm find. arrays.cpp #include using namespace std; 1 3 const double* pfind(const double a[], size_t len, double value) { 4 7 8 | 9. } CodeCheck Reset
Rewrite the Binary search function in the textbook to use a generic type for the array elements. Test the function with arrays of int, double, and string values. *When using test arrays make sure elements are stored in ascending sorted order*
Instead of using parallel arrays, use an array of structs and redo assignment 8as follows:struct candidateType {string name;int numVotes;double percent;};Write a program vote.cc that allows to read from a file vote.in the last names ofthe candidates in an election and the number of votes received by each candidate. Theprogram should then output each candidate’s name, the number of votes received, and thepercentage of the total votes received by the candidate in descending order. Your programshould also output the winner of the election. A sample output is:Candidate Votes Received % of Total VotesJohnson 6000 31.09Brown 5000 25.91Miller 4000 20.73Duffy 2500 12.95Robson 1800 9.33Total 19300The Winner of the Election is JohnsonYour program should have and use at least the following functions:(a) Write a function openFile that prompts a user to enter a file name and opens it.(b) Write a function closeFile that closes an open file.(c) Write a function getData that reads from the file the…
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. Solution should avoid Runtime Error
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
DescriptionWrite a program that asks the user for an integer value greater than zero. It will verify that the user has entered a valid value and then try to allocate enough space using malloc for an array of n elements where n is the integer they entered in the first step.Your program should make sure that the allocation worked and then call a function named fillArray that uses a for loop and the square brackets operator to fill the array with the first n odd numbers. For example, the variable that is zero elements away from the base address shouldget the value 1, the value that is 1 element away from the base address should get the value 3, and so on (see the screen shot below). Afterwards, call another function called printDown that uses another for loop and the square brackets operator to print them in reverse order separated bynew lines.Print a line that has 3 asterisks (''*,,) in it by itself. Finally, call another function called printUp that uses another for loop that prints all…

SEE MORE QUESTIONS

Recommended textbooks for you

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

Programming with Microsoft Visual Basic 2017

Computer Science

ISBN:

9781337102124

Author:

Diane Zak

Publisher:

Cengage Learning

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

Programming with Microsoft Visual Basic 2017

Computer Science

ISBN:

9781337102124

Author:

Diane Zak

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS