Write a program to sort an array of random elements using quicksort as follows: 1. Sort the arrays using pivot as the first element of the array 2. Sort the arrays using pivot as the median of the first, last, and middle elements of the array 3. Sort the arrays using pivot as the first element of the array. However., when the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. 4. Sort the array using pivot as the median of the first, last and middle elements of the array. When the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. 5. Calculate and display the CPU time for each of the preceding four steps. Example of the median of the first, last and middle elements: 123456780 (median of 1, 5, 0 is 1) 801234567 (median of 8, 3, 7 is 7) To calculate the CPU time, use the header , and clock_t type. You need to cast the duration to float and divide it by CLOCKS_PER_SEC. Depends on the CPU of your computer, your outputs would not be the same as in the sample output below.

Write a program to sort an array of random elements using quicksort as follows: 1. Sort the arrays using pivot as the first element of the array 2. Sort the arrays using pivot as the median of the first, last, and middle elements of the array 3. Sort the arrays using pivot as the first element of the array. However., when the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. 4. Sort the array using pivot as the median of the first, last and middle elements of the array. When the size of any sub-list reduces to less than 20, sort the sub-list using insertion sort. 5. Calculate and display the CPU time for each of the preceding four steps. Example of the median of the first, last and middle elements: 123456780 (median of 1, 5, 0 is 1) 801234567 (median of 8, 3, 7 is 7) To calculate the CPU time, use the header , and clock_t type. You need to cast the duration to float and divide it by CLOCKS_PER_SEC. Depends on the CPU of your computer, your outputs would not be the same as in the sample output below.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Part 1 & 2) Lottery Winners Write a program that initializes an array with ten numbers (given below). Then let the player enter his or her lottery number. The program should ask the user if he/she wants to perform a linear search or binary search. (If the user chooses binary search, using one of the sorting algorithms we learned in the class, sort the array). Based on the searching algorithm payer chooses, it should print out the number of searching comparisons performed and if it was a winning number. int ticket[] = {85647, 62483, 13579, 26792, 52551, 33445, 79422, 76172, 93121, 26791 };\ Microsoft Visual Studio Debug Console Enter your 5-digit lottery number: 12345 Press 1 to perform linear search, 2 for binary search: 1 Original values: 85647 62483 13579 26792 52551 33445 79422 76172 93121 26791 Number of comparisons made: 10 You did not win. Microsoft Visual Studio Debug Console Enter your 5-digit lottery number: 12345 Press 1 to perform linear search, 2 for binary search: 2…
Subject-Object oriented programing Write a program which:• creates a new Array List• adds 5 decimal numbers to it• prints the list to the screen In the same program, use a 'for' loop to print each element of the Array List to the screen.
Find primes This program creates and displays a 5x10 matrix(5 rows and 10 columns) of random integers between 1 and a maximum value(user input). Hint: Use the random library to generate each number and place it into your 2D list. The program then counts the number of prime numbers in each row of the array and displays this number, along with the found primes. The program finally displays the total number of prime numbers in the matrix.
Individual Exercise: Sieve of Eratosthenes O The Sieve of Eratosthenes is a technique for finding all the prime numbers up to a given last number. o It can be implemented as a program by using the algorithm (steps) given below. " Create a variable for the last number initialized as 100 etc. (e.g., int lastNumber = 100;) • Create a boolean array isPrime[] to keep track of which numbers up to lastNumber are prime. O The length of the array must be equal to lastNumber + 1 as the array indexes start from zero. o Note: The default value is false for all the array elements when a boolean array is created by using new. ' Set all the array elements beginning from index = 2 (the first prime number) to true. ' Outer loop: Repeat the following steps for each number num within 2 <= num <= lastNumber / num. o if isPrime[num] is true (meaning that num is prime as no factors exist for num): " Inner loop: Set the isPrime[] elements for all the multiples of num to false. O When the nested loop ends,…
True or False For each statement below, indicate whether you think it is True or False If you have an array with no “holes”, the append function performs at O(1) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1)
True or False For each statement below, indicate whether you think it is True or False If you have an array with no “holes”, the append function performs at O(1) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario True If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)
Arrays Arrays- Lists In Pyhon Assignment: Create a program which does the following: 1. Asks the user for 5 numbers. 2. Prints out the numbers entered. 2. Prints out the average of those five numbers Cree un programa que haga lo siguiente: 1. Pide al usuario 5 números. 2. Imprime los números ingresados. 3. Imprime el promedio de esos cinco números An example of possible output is shown below: A continuación se muestra un ejemplo de salida posible: Output You entered the following numbers: 10 20 30 40 The average of the numbers is: 25.0
1) Create an Array which can contain 15 elements using an initializer list. 2) The values in the list will be: 99, 45, 1, 51, 11, 71, 22, 33, 44, 55, 32, 64, 88, 76, 88 3) Print the elements of the array from first to last using a loop. Use the length property to print the elements. 4) Using Selection Sort, sort the array in increasing order. 5) Print the elements of the array from first to last using a loop. Use the length property to print the elements.
Sorting is a basic issue with arrays in which the goal is to find the target element in the array. Choose from the following options: False
ARRAY RANDOMIZER Create a program that shuffels all the elements present in an array. To shuffle an array, you need to do at least 500 random swaps of any elements in the array given below. Print the shuffled array in the output. {12, 54, 22, 100, -3, 5, 10, -33, 78, 90, 29, -45, 77, -9, 19, 21} Language: CPP
Remove Char This function will be given a list of strings and a character. You must remove all occurrences of the character from each string in the list. The function should return the list of strings with the character removed. Signature: public static ArrayList<String> removeChar(String pattern, ArrayList<String> list) Example:list: ['adndj', 'adjdlaa', 'aa', 'djoe']pattern: a Output: ['dndj', 'djdl', '', 'djoe']
Finding the common members of two dynamic arrays: Write a program that first reads two arrays and then finds their common members (intersection). The program should first read an integer for the size of the array and then should create the two arrays dynamically (using new) and should read the numbers into array1 and array2 and then should find the common members and show it. Note: The list of the common members should be unique. That is no member should be listed more than once. Tip: A simple for loop is needed on one of the arrays (like array1) and one inner for loop for on array2. Then for each member of array1, if we find any matching member in array2, we record it. Sample run: Enter the number of elements of array 1: 7 Enter the elements of array 1: 10 12 13 10 14 15 12 Enter the number of elements of array 2: 5 Enter the elements of array 2: 17 12 10 19 12 The common members of array1 and array2 are: 12 10