6. Below is a table that shows the timing of three different algorithms using an array of integers as input. Explain which of the algorithms is most likely the selection sort and which is the merge sort, explain in details your answer. Algorithm 1 Algorithm 2 Algorithm 3 time to process 2000 integers 0.1431 sec 0.8011 sec 0.0132 sec time to process 4000 integers 0.5722 sec 1.4300 sec 0.0304 sec time to process 8000 integers 2.2989 sec 2.4512 sec 0.0634 sec

6. Below is a table that shows the timing of three different algorithms using an array of integers as input. Explain which of the algorithms is most likely the selection sort and which is the merge sort, explain in details your answer. Algorithm 1 Algorithm 2 Algorithm 3 time to process 2000 integers 0.1431 sec 0.8011 sec 0.0132 sec time to process 4000 integers 0.5722 sec 1.4300 sec 0.0304 sec time to process 8000 integers 2.2989 sec 2.4512 sec 0.0634 sec

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

Which of the following is a limitation of the asymptotic run-time analysis of algorithms? Such analysis gives accurate predictions only for small and medium input sizes because constant factors are not taken into account. In order to compare two algorithms, the same software environments must be considered. Such analysis may give inaccurate predictions for actual running times because constant factors are not taken into account. It considers only algorithms implemented in Java.
Given the following list: 90 8 7 56 123 235 9 1 653 Show a trace of execution for the following sorts (show all necessary steps): selection sort insertion sort bubble sort quick sort merge sort
Which of the following sorting algorithms provide the best time complexity in the worst-case scenario? A. Merge Sort B. Quick Sort C. Bubble Sort D. Selection Sort
Six, the starting permutation position of the items to be sorted determines the number of comparisons needed by any sorting method. 7 When the information to be sorted is not strictly ordered, bubble sort performs better than quick sort.
a) Refer to the number list below, explain how selection sort algorithm re-arrange all values in the number list, in ascending order. index value 0 89 1 2 2 23 3 19 4 78 5 60 b) Refer to the question 4(a) above, what is the result of the number list after sorted? c) Explain the differences between selection sort algorithm and merge sort algorithm.
1 Sequence (46, 79, 56, 38, 40, 84), using quick sorting (with the leftmost element as the pivot), the first partition result is: OA 38 46 79 56 40 84 OB 38 79 56 46 40 84 OC 40 38 46 56 79 84 OD 38 46 56 79 40 84 2 Each time an element is taken from the unsorted sequence, compared with the elements in the sorted sequence, and then inserted into the appropriate position in the sorted sequence. What is the name of this sort method? A Bubble sort OB Direct insert sort OC Select sort OD Merge sort
Order these three sorting algorithms according to their BEST-case running time. The fastest should be first, and the slowest should be last. Fastest (the best one) 1 | Merge Sort E Insertion Sort 3 : Selection Sort 4 : Bubble Sort
Unordered list: 33 42 35 50 20 16 45 26 5 72 18 Answer the ff: 1.How many process using insertion sort? 2.What is the 8th process using Insertion sort? 3.How many process using bubble sort algorithm? 4.What is the 5th process using bubble sort algorithm?
Write the step-by-step procedure (algorithms) of the following sort algorithms. Note: do not copy fromany resource, use your own words!a) Bubble Sortb) Insertion Sortc) Selection Sort
True/False 9. Merge sort is an example of an n log n algorithm.
The study of computers and their uses. How can I pinpoint the exact moment when the quick sort transforms into the insertion sort? a lot of websites assert that the answer is 10, but why is that the case?
3. What is the best sorting algorithm can be combined with the following and explain the reason briefly: (a) Radix Sort (b) Bucket Sort