1. Apply Quick-sort on a given sequence 71 21 10 95 76 3 50 61. What is the sequence after the first phase, the pivot is the first element? 3 10 21 50 61 71 76 95 21 103 50 61 76 95 71 61 21 10 3 50 71 76 95 61 213 10 50 71 76 95 None 2. Consider the Quick-sort algorithm, which partitions elements into two sub-arrays, each of which contains at least one-tenth of the elements. Allow T(n) to represent the number of comparisons necessary to sort an array of n elements. T(n) = 2 T(n/10) + cn T(n) = T(n/10) + T(9n/10) + cn T(n) = 2 T(n/10) + c T(n) = T(n/10) + T(9n/10) + c None 3. Which of the following statements about merge sort is not correct? stable algorithm an adaptive algorithm out of place algorithm a comparison-based sort

1. Apply Quick-sort on a given sequence 71 21 10 95 76 3 50 61. What is the sequence after the first phase, the pivot is the first element? 3 10 21 50 61 71 76 95 21 103 50 61 76 95 71 61 21 10 3 50 71 76 95 61 213 10 50 71 76 95 None 2. Consider the Quick-sort algorithm, which partitions elements into two sub-arrays, each of which contains at least one-tenth of the elements. Allow T(n) to represent the number of comparisons necessary to sort an array of n elements. T(n) = 2 T(n/10) + cn T(n) = T(n/10) + T(9n/10) + cn T(n) = 2 T(n/10) + c T(n) = T(n/10) + T(9n/10) + c None 3. Which of the following statements about merge sort is not correct? stable algorithm an adaptive algorithm out of place algorithm a comparison-based sort

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

Apply bubble sort algorithm to the following array, and contents of arr[] after each pass. arr[] 65 55 35 25 45 15 After pass 1: After pass 2: After pass 3: After pass 4: After pass 5:
In programming language C Write a program to take input for two 1D array elements. Perform the sum of their elements and store the result in third array (1D). After this, arrange the elements of third array in ascending order and then implement binary search on the arranged array.
Given an array arg[] below, use the incremental approach to sort it in assending order 11 42 35 38 22 45 18 39 3
Write an algorithm that, given an array, initialises all the elements so that thecontent of each element is the index (i.e. A[i] contains i), then multiplies all theelements of the array together to give the result.
Write the code of the insertion-sort algorithm. Illustrate the execution of the algorithm on the array A = 3, 13, 89, 34, 21, 44, 99, 56, 9, writing the intermediate values of A at each iteration of the algorithm.
Following is the function for interpolation search. This searching algorithm estimates the position (index) of a key in array based on the elements in the first position and last position in the array, and the length of array. The array must be sorted in ascending order. Suppose array A contains the following 15 elements: A = [1, 3, 3, 10, 17, 22, 22, 22, 24, 25, 26, 27, 27, 28, 28] At first iteration, at which position (index) the element of 24 is estimated in array A? In which part of array (starting index and ending index) the searching should continue? How many iterations the searching are performed until the element of 24 is found? int InterpolationSearch(int x[], int key, int n) { int mid, min = 0, max = n-1; while(x[min] < key && x[max] > key) { mid = min + ((key-x[min])*(max-min)) / (x[max]-x[min]); if(x[mid] < key) min = mid + 1; else if(x[mid] > key) max = mid - 1; else return mid; } if…
Consider a Binary Search Algorithm that performs a search for the number 48 within the following unsorted list. Using paper and pencil, show the detailed steps for that search algorithm until 48 is found. You must use bubble sort if need it.1019134353415604870
H3. Let S = [x1, x2, x3, ...xn], where n ≥ 5. How many ways can you choose five of the values in the array S, given that x1 = x2 = x3 and all other xi are distinct? The order of the chosen elements does not matter
During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot. The algorithm for Quick Sort is given below. Modify it in such a way that last element of array should be selected as a pivot at each iteration. Also explain the advantages.
Pseudo Code shown in Figure Q1(a) is an algorithm for binary searching for an array with n number of elements. By applying this algorithm, show step by step approach on how to find number 11 in an array as depicted in Figure Q1(b). low + 0 high e n-1 while (low s high) do ix + (low + high) /2 if (t = Alix)) then return ix else if (t < A[ix]) then high e ix - 1 else low + ix + 1 return -1 Figure Ql(a) 2 4 6 9 11 12 | 25 [0] [1) [2] [3] (4) [5) [6] Figure Q1(b)
Write the algorithm for both the normal and modified bubble sort algorithm for thefollowing numbers to be sorted. Show the various passes to sort the array list given asA= [ 25, 26,16,18,15]
1. Consider an array of 66000 sorted entries. What is the maximum number of comparisonsthat must be made to find any arbitrary value in the array?