Question 1 Note: Assume that all the following sorting algorithms sort in increasing order. 1.Consider the following elements 6,1,8,3,2,0. The order of the elements after 3 element swaps of the Insertion-sort algorithm is: O 1, 3, 6, 2, 8, 0 O 1, 6, 3, 8, 2, 0 O None O 1, 3, 2, 6, 8, 0 O 1, 3, 6, 8, 2, 0 QUESTION 2 2.Consider the following elements 6,1,8,3,2,0 . The order of the elements after 4 element swaps of the Selection-sort algorithm is (swapping an element with itself is also counted): O 0, 1, 2, 3, 8, 6 O 0, 1, 8, 3, 2, 6 O 0, 1, 2, 3, 6, 8 O 0, 1, 6, 3, 8, 2 O None QUESTION 3 3. Consider the following elements 6,1,8,3,2,0. The order of the elements after 6 element swaps of the Bubble-sort algorithm is: O 1, 6, 3, 2, 0, 8 O None O 1, 3, 2, 0, 6, 8 O 1, 3, 2, 6, 0, 8 O 1, 3, 6, 2, 0, 8

Question 1 Note: Assume that all the following sorting algorithms sort in increasing order. 1.Consider the following elements 6,1,8,3,2,0. The order of the elements after 3 element swaps of the Insertion-sort algorithm is: O 1, 3, 6, 2, 8, 0 O 1, 6, 3, 8, 2, 0 O None O 1, 3, 2, 6, 8, 0 O 1, 3, 6, 8, 2, 0 QUESTION 2 2.Consider the following elements 6,1,8,3,2,0 . The order of the elements after 4 element swaps of the Selection-sort algorithm is (swapping an element with itself is also counted): O 0, 1, 2, 3, 8, 6 O 0, 1, 8, 3, 2, 6 O 0, 1, 2, 3, 6, 8 O 0, 1, 6, 3, 8, 2 O None QUESTION 3 3. Consider the following elements 6,1,8,3,2,0. The order of the elements after 6 element swaps of the Bubble-sort algorithm is: O 1, 6, 3, 2, 0, 8 O None O 1, 3, 2, 0, 6, 8 O 1, 3, 2, 6, 0, 8 O 1, 3, 6, 2, 0, 8

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

Computer Science 1)What are the steps in the selection sort algorithm? Group of answer choices Split the array into two subarrays, sort each subarray, and append the two arrays together. Starting at index 0, search the entire array to find the smallest value and swap the smallest value with the value at index 0. 2)Suppose there an integer threshold such that the expression n2 is equal to the expression 9n-8 at that threshold, and is larger for all integers values larger than the threshold. What does this mean?
help
How to solve this question
Define Selection Sort and Bubble Sort algorithms. How would you sort the following array using selection and bubble sort algorithms. What is the time complexity of each algorithms? a=[4, 2, 6, 5]
(b) Consider an array (num), which consists of numbers = [012 3 4 5 6 7 89 ]. Sort by hand the array num in ascending order using the following sorting algorithms. Show all steps involved. (i) Selection sort (ii) Insertion sort
Given the following array: [7,8, 5, 2, 4, 6, 3, 99] Illustrate the sorting of the array using insertion sort. Illustrate the sorting of the array using merge sort.
Sorting Algorithms 1.) Trace the insertion sort as it sorts the array 25 30 20 80 40 60 into descending order.
Q1: Sort the following array using Heap sort i.e. i. S,0,R,T,I,N,G Q 2: Sort the following using merge sort: 85, 24, 63, 45, 17, 31, 96, 50 Q 3: Write an algorithm for Quick Sort. Q 4: Find the minimum spanning tree using Kruskal's Algorithm. A 10 D 3 B 6 4 4 1 H F G 5. 3) 6, 2.
1. (a). Illustrate how Bubble sort will sort the following elements of the array a[6] in ascending order: 30, 80, 20, 45, 65, 50. (b). How many passes and how many comparisons will the bubble sort algorithm make to sort the input array a[n] in ascending order if the smallest value is in location a[n-2].
Given are the elements of an amay that needs to be sorted ascending order. Simulate each of the following amrays below using the different sorting algorithms: 1. Selection Sort 44 38 47 46 19 50 48 2. Insertion Sort 5 44 38 47 15 36 26 3. Quick Sort 2 29 19 35 16 17 18 26 48 11 4. 3.