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

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
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
The bubble sort algorithm discussed in class is used to sort the following sequence of integers: 2 16 38 9 4 14 How many passes must the algorithm perform to guarantee the entire sequence is sorted? What is the list obtained after the first pass? What is the list obtained after the third pass? What is the list obtained after the final pass?
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?
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?
The script has four steps: Read a list of integers (no duplicates). Output the numbers in the list. Perform an insertion sort on the list. Output the number of comparisons and swaps performed during the insertion sort. Steps 1 and 2 are provided in the script. Implement step 3 based on the insertion sort algorithm in the book. Modify insertion_sort() to: Count the number of comparisons performed. Count the number of swaps performed. Output the list during each iteration of the outside loop. Implement step 4 at the end of the script. Hints: In order to count comparisons and swaps, modify the while loop in insertion_sort(). Use global variables for comparisons and swaps. The script includes three helper functions: read_nums() # Read and return a list of integers. print_nums(nums) # Output the numbers in nums swap(nums, n, m) # Exchange nums[n] and nums[m] Ex: When the input is: 3 2 1 5 9 8 the output is: 3 2 1 5 9 8 2 3 1 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 9 8 1 2 3 5 8 9…
Arrange the given integer values in increasing order by applying step by step quicksort algorithm with following conditions: (a) Always choose first element of the list as pivot. (b) Do not assume infinity or maximum element at the end of the list during sorting. Given Data: 15, 11, 13, 14, 10, 8, 7, 9, 3, 5 (Initially, Pivot=15).
Which of the following algorithms is better to sort a mostly sorted data sequence? A data sequence is mostly sorted if only a handful of integers don't appear in the longest sorted subsequence. For example, the following data sequence is almost sorted since there is only one integer (0) out of place in a sorted sequence of numbers: 1, 2, 3, 4, 0, 5, 6, 7, 8, 9 Question 28 options: merge sort selection sort insertion sort quick sort
solve this problem using python
2. Sorting Algorithm Exercises Show the results of each swap (exchange) applying the given sorting algorithm on the following set of initial array values. BUBBLE SORT SELECTION SORT 32 8 16 4 24 64 32 8. 16 4 24 2 64 When finished, make sure to click Submit. Optionally, click Save as Draft to save changes and continue working later, or click Cancel to quit without saving changes. SAMSUNG % %24