Shell sort is an in-place comparison-based sorting algorithm which is based on insertion sort algorithm.It works as follow :It breaks the original list into a number of smaller sublists, each of which is sorted using an insertion sort. Theunique way that these sublists are chosen is the key to the shell sort. Instead of breaking the list into sublists ofcontiguous items, the shell sort uses an increment i, sometimes called the gap, to create a sublist by choosingall items that are i items apart.na) We say that the our initial gap is floor:when we divide our sequence into2knsublists where2kk>0 be the number of passes that can be increment until the denominator not greater than n,nand then sorting the elements which areposition away with insertion sort. We have three2kpasses for an array size of 8 to 15.Demonstrate the Shell algorithm on the input array A = [35,33,42,10,14,19,27,44] showing how even-%3Dпtually the algorithm outputs the sorted array [10,14,19,27,33,35,42,44] with initialgap2k*Clearly showall of your steps.

Shell sort is a highly efficient sorting algorithm and is based on insertion sort algorithm. This…

Shell sort is an in-place comparison-based sorting algorithm which is based on insertion sort algorithm. It works as follow : It breaks the original list into a number of smaller sublists, each of which is sorted using an insertion sort. The unique way that these sublists are chosen is the key to the shell sort. Instead of breaking the list into sublists of contiguous items, the shell sort uses an increment i, sometimes called the gap, to create a sublist by choosing all items that are i items apart. n п a) We say that the our initial gap is floor when we divide our sequence into sublists where 2k 2k k>0 be the number of passes that can be increment until the denominator not greater than n, and then sorting the elements which are position away with insertion sort. We have three passes for an array size of 8 to 15. Demonstrate the Shell algorithm on the input array A = [35,33,42,10,14,19,27,44] showing how even- п tually the algorithm outputs the sorted array [10,14,19,27,33,35,42,44] with initial gap k: Clearly show all of your steps.

Shell sort is an in-place comparison-based sorting algorithm which is based on insertion sort algorithm. It works as follow : It breaks the original list into a number of smaller sublists, each of which is sorted using an insertion sort. The unique way that these sublists are chosen is the key to the shell sort. Instead of breaking the list into sublists of contiguous items, the shell sort uses an increment i, sometimes called the gap, to create a sublist by choosing all items that are i items apart. n п a) We say that the our initial gap is floor when we divide our sequence into sublists where 2k 2k k>0 be the number of passes that can be increment until the denominator not greater than n, and then sorting the elements which are position away with insertion sort. We have three passes for an array size of 8 to 15. Demonstrate the Shell algorithm on the input array A = [35,33,42,10,14,19,27,44] showing how even- п tually the algorithm outputs the sorted array [10,14,19,27,33,35,42,44] with initial gap k: Clearly show all of your steps.

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

Related questions

Q: Show how the Selection Sort works on this list array to sort it in ascending order. 55 35 20 80 90…

A: This question comes from Data Structure which is a paper of computer science. Let's discuss it in…

Q: Sort the list A , N , A , L , Y , S , I , S in alphabetical order by Selection sort and Bubble…

A: Considering the following array as an example: arr[] = {A,N,A,L,Y,S,I,S}

Q: An array may contain multiple duplicate values, as shown below. In order to design an algorithm with…

A: According to the information given:- We have to choose the correct option to satisfy the statement.

Q: Quick Sort is used for most default sorting functions. Why is QuickSort the preferred algorithm when…

A: Given:- Quick Sort is used for most default sorting functions. Why is QuickSort the preferred…

Q: Selection Sort The selection sort improves on the bubble sort by making only one exchange for every…

A: In this question we have to understand about the selection sort process for the given list and…

Q: T/F: Both Merge Sort and Quick Sort have a worst case runtime of O(n log n).

A: Answer is given below .

Q: tep by Step Sorts : Show the steps taken by each sort on the following unordered list of integers…

A: In this question, it is asked to provide the step-by-step forming of the sorting algorithm for a…

Q: Write a bubble sorting algorithm that sorts a 10-element array called sortarray from smallest to…

A: Bubble sort Algorithm Bubble sort works on the repeatedly swapping of adjacent elements until they…

Q: What is the time complexity for the following code/program? 1.5 A binary search works like this:…

A: A binary search tree is an advanced algorithm used to analyze a node, its left and right branches,…

Q: inner iteration. Through cach iteration of the outer ite insorted portion will be “bubbled" to the…

A: Q.

Q: On the following groups, track the insertion sort passes: i) {H, K, M, N, P} ii) {P, N, M, K, H}…

A: Introduction: Insertion sort is a simple and efficient algorithm used for sorting arrays or lists of…

Q: using selection sort algorithm, the intermediate sorting results of sorting the array…

A: Given array is {12,4,25,20,6,3,100} First Iteration: 100 4 25 20 6 3 12

Q: Six, the starting permutation position of the items to be sorted determines the number of…

A: It is correct that the first permutation of the data has an effect on the number of comparisons…

Q: Select all the statements that are false, bubble sort is defined below:* Quicksort is…

A: Selection sort has the worst space complexity among all the sorting algorithm it is incorrect since…

Q: Trace each pass of selection, insertion, and quick sort for the list of values below. For quick…

A: Sorting is the process of arranging a set of items in a certain order, usually in ascending or…

Q: The list {118, 6, 43, 36, 25, 3, 26} after the first pass of Radix sort becomes

A: Radix sort is a sorting algorithm that sorts the elements by first grouping the individual digits of…

Question

Shell sort is an in-place comparison-based sorting algorithm which is based on insertion sort algorithm.
It works as follow :
It breaks the original list into a number of smaller sublists, each of which is sorted using an insertion sort. The
unique way that these sublists are chosen is the key to the shell sort. Instead of breaking the list into sublists of
contiguous items, the shell sort uses an increment i, sometimes called the gap, to create a sublist by choosing
all items that are i items apart.
n
a) We say that the our initial gap is floor:
when we divide our sequence into
2k
n
sublists where
2k
k>0 be the number of passes that can be increment until the denominator not greater than n,
n
and then sorting the elements which are
position away with insertion sort. We have three
2k
passes for an array size of 8 to 15.
Demonstrate the Shell algorithm on the input array A = [35,33,42,10,14,19,27,44] showing how even-
%3D
п
tually the algorithm outputs the sorted array [10,14,19,27,33,35,42,44] with initial
gap
2k*
Clearly show
all of your steps.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1 Defination and algorithm

VIEW

Step 2 Steps to sort

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Trace the passes of insertion sort on the following lists:i) {H, K, M, N, P} ii) {P, N, M, K, H}Compare their performance in terms of the comparisons made.
Trace the passes of insertion sort on the following lists:i) {H, K, M, N, P} ii) {P, N, M, K, H}Compare their performance in terms of the comparisons made.
int [] list = {18,57,8,89,7} and the length = 5 Sort the array using insertion sort algorithm. Fill out the trace table public class InsertionSort { /** The method for sorting the numbers */ public static void insertionSort(int[] list) { for (int i = 1; i < list.length; i++) { /** insert list[i] into a sorted sublist list[0..i-1] so that list[0..i] is sorted. */ int currentElement = list[i]; int k; for (k = i - 1; k >= 0 && list[k] > currentElement; k--) { list[k + 1] = list[k]; } // Insert the current element into list[k+1] list[k + 1] = currentElement; } } /** A test method */ public static void main(String[] args) { int[] list = {18,57,8,89,7}; insertionSort(list); for (int i = 0; i < list.length; i++) System.out.print(list[i] + " "); } }
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 best case behaviour occurs for quick sort when the partition function splits the sequence of size n into subarrays of size: Select one: a.n/4 : 3n/4 b.n/4 : 3n/2 c.3n/8 : (5n/8) d.n/2 : (n/2)-1 e.n/2 : n/3
Binary search can only be performed on a/an ………… Sorted array/list Random array/list Any array/list Disordered array/list
Write the state of the elements of the vector below after each of the first 4 passes of the outermost loop of the insertion sort algorithm. (After the first pass, 2 elements should be sorted. After the second pass, 3 elements should be sorted. And so on.) // index 0 1 2 3 4 5 6 7 vector<int> numbers{29, 17, 3, 94, 46, 8, -4, 12}; insertionSort(numbers); NOTE: Write your answer inside curly braces with numbers separated by commas {29, 17, 3, 94, 46, 8, -4, 12} after pass 1 after pass 2 after pass 3 after pass 4
c++
Quicksort is a powerful divide-and-conquer sorting algorithm that can be described in just four lines ofpseudocode. The key to Quicksort is the PARTITION(A, p, r) procedure, which inputs elementsptorof array A,and chooses the final element x = A[r] as the pivot element. The output is an array where all elementsto the left ofxare less thanx, and all elements to the right of x are greater than x. In this question, we will use the Lomuto Partition Method from class and assume that the pivot isalwaysthe last (right-most) element of the input array. Question: Let A be an array withn= 2k−1 elements, where k is some positive integer. Determine a formula (in terms of n) for the minimum possible number of total comparisons required by Quicksort, as well as a formula for the maximum possible number of total comparisons required by Quicksort. Use your formulas to show that the running time of Quicksort is O(nlogn) in the best case and O(n2) in the worst case.
Assume that we have a sorted list in an array: Index: 0 1 2 3 4 5 6 7 8 9 10 11 numbers: 12 15 17 19 22 26 28 30 32 34 36 38 we want to use the binary search algorithm to find the value 19 in the list. What would be the indexes of the array that the binary search would check to find the value 19 the indexes and not the actual numbers in the list otherwise
3. Given the following list: 9 4 2 6 7 5 3 8 Identify the state of the list while being sorted using the selection sort algorithm.
Select all the statements that are false, bubble sort is defined below:* Quicksort is the fastest sorting algorithm If you are lucky, you can get O(n) time complexity in Mergesort On the worst case, Bubble sort will give you O(n logn) time complexity Average time complexity of insertion sort is much better than bubble sort Selection sort has the worst space complexity among all the sorting algorithm