There is a variation of the bubble sort algorithm called a gap sort that, rather than comparing neighboring elements each time through the list, compares elements that are some number i positions apart, where i is an integer less than n. For example, the first element would be compared to the (i + 1) element, the second element would be compared to the (i + 2) element, the nth element would be compared to the (n - i) element, and so on. A single iteration is completed when all of the elements that can be compared, have been compared. On the next iteration, i is reduced by some number greater than 1 and the process continues until i is less than 1. Implement a gap sort.

There is a variation of the bubble sort algorithm called a gap sort that, rather than comparing neighboring elements each time through the list, compares elements that are some number i positions apart, where i is an integer less than n. For example, the first element would be compared to the (i + 1) element, the second element would be compared to the (i + 2) element, the nth element would be compared to the (n - i) element, and so on. A single iteration is completed when all of the elements that can be compared, have been compared. On the next iteration, i is reduced by some number greater than 1 and the process continues until i is less than 1. Implement a gap sort.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 9RQ

See similar textbooks

Similar questions

A gap sort is a version of the bubble sort method that compares items that are some number i places away, where i is an integer smaller than n, rather than neighbouring elements each time across the list. For example, the first element would be compared to the (i + 1) element, the second element to the (i + 2) element, the nth element to the (n - i) element, and so on. When all of the items that may be compared have been compared, a single iteration is accomplished. On the following iteration, i is reduced by a value bigger than one, and the procedure is repeated until i is less than one. Utilise a gap kind.
There is a variation of the bubble sort algorithm called a gapsort that, rather than comparing neighboring elements eachtime through the list, compares elements that are some numberi positions apart, where i is an integer less than n. For example,the first element would be compared to the (i + 1) element, thesecond element would be compared to the (i + 2) element,the nth element would be compared to the (n - i) element,and so on. A single iteration is completed when all of theelements that can be compared, have been compared. On thenext iteration, i is reduced by some number greater than 1and the process continues until i is less than 1. Implement agap sort.
A variation of the bubble sort algorithm known as a gap sort examines elements that are some number I positions apart, where I is an integer less than n, rather than neighbouring elements each time through the list. The first element, for instance, would be compared to the element I + 1), the second element, to the element I + 2), the nth element, to the element (n - I and so on. Once all the components that can be compared have been done so, the iteration is finished. I am decreased by a factor greater than 1 on the following iteration, and the procedure continues until I is less than 1. Apply the gap filter.
A gap sort is an adaptation of the bubble sort technique that compares items that are i places or more apart from each other rather than nearby components every time through the list. For instance, the comparison between the first element and the (i + 1) element, the second element and the (i + 2) element, the nth element and the (n - i) element, and so on. A single iteration is completed after all the elements that can be compared have been evaluated. I is decreased by a number greater than one on the subsequent iteration, and the process is continued until i is less than one. Make use of a gap type.
A version of the bubble sort method known as a gap sort compares items that are some number i places away, where i is an integer smaller than n, rather than neighbouring elements each trip across the list. The first element, for instance, would be compared to the element (i + 1), the second element, to the element (i + 2), the nth element, to the element (n - i), and so on. Once all the elements that may be compared have been done so, the iteration is finished. I am decreased by a factor bigger than 1 on the following iteration, and the process continues until i is less than 1. Utilise a gap kind.
Sorting is useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses as well. In this case, it will make it easier to determine which pair or pairs of elements have the smallest absolute difference between them. Example [5, 2, 3, 4, 1] arr = Sorted, arr' = [1, 2, 3, 4, 5]. Several pairs have the minimum difference of 1: [(1,2), (2, 3), (3, 4), (4, 5)]. Return the array [1, 2, 2, 3, 3, 4, 4, 5]. Note As shown in the example, pairs may overlap. Given a list of unsorted integers, arr, find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. Function Description Complete the closestNumbers function in the editor below. closestNumbers has the following parameter(s): int arr[n]: an array of integers Returns - int[]: an array of integers as described Input Format The first line contains a single integer n, the length of arr. The second line contains n…
Another simple sort is the odd-even sort. The idea is to repeatedly make twopasses through the array. On the first pass you look at all the pairs of items,a[j] and a[j+1], where j is odd (j = 1, 3, 5, …). If their key values are out oforder, you swap them. On the second pass you do the same for all the evenvalues (j = 2, 4, 6, …). You do these two passes repeatedly until the array issorted. Replace the bubbleSort() method in bubbleSort.java (Listing 3.1) withan oddEvenSort() method. Make sure it works for varying amounts of data.You’ll need to figure out how many times to do the two passes.The odd-even sort is actually useful in a multiprocessing environment, where aseparate processor can operate on each odd pair simultaneously and then oneach even pair. Because the odd pairs are independent of each other, each paircan be checked—and swapped, if necessary—by a different processor. Thismakes for a very fast sort.
Apply Selection Sort on the following list of elements: 16, 23, 19, 6, 20, 10, 34, 54
Language: Python 3 Autocomplete Ready O 1 v import ast 3. Hybrid Sort input() lst %3D 3 lst = ast.literal_eval(lst) 4 Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. In each iteration, insertion sort inserts an element into an already sorted list (on left). The position where the item will be inserted is found through linear search. You decided to improve insertion sort by using binary search to find the position p where the new insertion should take place. 6 print(BinaryInsertionSort(lst)) Algorithm BinarylnsertionSort Input/output: takes an integer array a = {a[0], ..., a[n – 1]} of size n begin BinarylnsertionSort for i =1 to n val = a[i] p = BinarySearch(a, val, 0, i – 1) for j = i-1 to p a[j + 1]= a[i] j= j-1 end for a[p] = val i i+1 end for end BinarylnsertionSort Here, val = a[i] is the current value to be inserted at each step i into the already sorted part a[0], ..., ați – 1] of the array a. The binary search along that part…
The optimised bubble sort offers none of the following benefits over conventional sorts for items that have already been sorted.
Consider sorting n numbers stored in array A[1:n] by first finding the smallestelement of A[1:n] and exchanging it with the element in A[1]. Then find thesmallest element of A[2:n], and exchange it with A[2]. Then find the smallestelement of A[3:n], and exchange it with A[3]. Continue in this manner for thefirst n-1 elements of A. Write pseudocode for this algorithm, which is knownas selection sort. What loop invariant does this algorithm maintain? Why does itneed to run for only the first n-1 elements, rather than for all n elements? Give theworst-case running time of selection sort in big theta notation. Is the best-case runningtime any better?
function Sum(A,left,right) if left > right: return 0else if left = right: return A[left] mid = floor(N/2) lsum = Sum(A,left,mid) rsum = Sum(A,mid+1,right) return lsum + rsum function CreateB(A,N)B = new Array of length 1 B[0] = Sum(A,0,N-1) return B Building on the above, in a new scenario, given an array A of non-negative integers of length N, additionally a second array B is created; each element B[j] stores the value A[2*j]+A[2*j+1]. This works straightforwardly if N is even. If N is odd then the final element of B just stores A[N-1] as we can see in the figure below: (added in image) The second array B is now introducing redundancy, which allows us to detect if there has been a hardware failure: in our setup, such a failure will mean the values in the arrays are altered unintentionally. The hope is that if there is an error in A which changes the integer values then the sums in B are no longer correct and the algorithm says there has been an error; if there were an error in B…