Bubble Sort An array is nearly-d sorted if any element is not further than d spots from its sorted position. Consider the sorted list of elements: X = [1,5,9, 10, 15, 20, 34, 57, 66, 91] The same elements form a nearly-sorted list: A = [1,5, 10, 15, 9, 20, 34, 57, 91, 66] with d = 2 because each value is, at most, 2 spots from its sorted position. Consider that the value 9 is out of order as it is in index 4² in A while it is in index 2 in B. Similarly, B = [1,5, 10, 9, 15, 20, 34, 57, 91, 66] %3D is nearly sorted with d = 1 as value 9 is in index 3 instead of index 2, 66 is in index 9 instead of index 8 and so on. Bubble Sort³, a sorting algorithm we have not covered, has an advantage over other methods when operating on nearly-d sorted lists. i Describe Bubble Sort's Advantage in the best case scenario over other methods. ii Bubble Sort need only pass through a nearly-d sorted list d times to ensure the list is sorted. Justify why this is the case. (Hint: consider the early termination condition of Bubble Sort)

Bubble Sort An array is nearly-d sorted if any element is not further than d spots from its sorted position. Consider the sorted list of elements: X = [1,5,9, 10, 15, 20, 34, 57, 66, 91] The same elements form a nearly-sorted list: A = [1,5, 10, 15, 9, 20, 34, 57, 91, 66] with d = 2 because each value is, at most, 2 spots from its sorted position. Consider that the value 9 is out of order as it is in index 4² in A while it is in index 2 in B. Similarly, B = [1,5, 10, 9, 15, 20, 34, 57, 91, 66] %3D is nearly sorted with d = 1 as value 9 is in index 3 instead of index 2, 66 is in index 9 instead of index 8 and so on. Bubble Sort³, a sorting algorithm we have not covered, has an advantage over other methods when operating on nearly-d sorted lists. i Describe Bubble Sort's Advantage in the best case scenario over other methods. ii Bubble Sort need only pass through a nearly-d sorted list d times to ensure the list is sorted. Justify why this is the case. (Hint: consider the early termination condition of Bubble Sort)

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

For each n-element array an, the first element is always what is returned by a[1]. What is true, and what is false?
Help please
ALGO1(A)// A is an integer array, an index that starts at 11): for i=1 to n-1 do2): minIndex = findSmallest(A,i)3): exchange A[i] with A[minIndex] The sub-routine find the smallest(A, i) in Line 2, and returns the index of the smallest element in thesub-array A[i:n]Suppose the array below is provided as input to ALGO1 2 5 6 7 3 8 1 4 Fill in the Blanks At the end of the first iteration of the for loop (i.e. with i=1)1) a) the element at index 1 is : b) the element at index 4 is : c) the element at index 7 is :
Given Array: [17 25 2 3 5 7 9 10 11 12] In the first pass, a greater element will be placed in the last of the array. Pass 1: [17 2 3 5 7 9 10 11 12 25] Pass 2: [ 2 3 5 7 9 10 11 12 17 25] this array will be sorted in 2 passes in bubble sort. Question: How can you optimize the bubble sort algorithm to stop unnecessary iteration after the array is sorted.
Q:During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot. The algorithm for Quick Sort is given below. Modify it in such a way that last element of array should be selected as a pivot at each iteration. Also explain the advantages.
9.). integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array. Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.
For each n-element array an, the first element is always what is returned by a[1]. What is true, and what is false?
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] + " "); } }
An inversion in an array is a pair of elements that are "out of order," meaning that the element that occurs earlier in the array is bigger than the one that occurs later. What is the largest-possible total number of inversions an 8-element array can have? O 64 O 15 O None of the choices O 7 O 28 O 32
Let A = [5,5,5,5,5,...,5] be an array where all of the elements are equal to 5. Determine whether Selection Sort or Insertion Sort sorts this array faster.
Consider the following linear array: array=[-6,2,1,-5,-1,7,8] If you remove an element in index 2 and then insert an element in index 4, MINIMUM how many elements in total need to be shifted for the full operation? When an element in a particular index moves to its adjacent left or right index, it is counted as one shift. 7 8
Study the function matrix_mult that takes two 2D arrays and performs a matrix multiplication and returns a new two-dimensional array. Each array should be represented as a list of lists. For example, A = [[1, 2, 3], [-2, 3, 7]] B = [[1,0,0],[0,1,O],[0,0,1]] matrix_mult(A, B) [[1, 2, 3], [-2, 3, 7]] Identify all lines that are in error - that is, select all answers that are correct. def matrix_mult(A, B): A_n = len(A) A_m = len(A[0]) B_n = len(B) B_m = len(B[0]) assert A_m = B_n R_n = A_n 1. 2. 3. 4. 5. 6. 7. 8. R_m = B_m R = [[0 for j in range (R_m)] fori in range(R_n)] def row(M, r): return v[c] for v in M def col(M, c): return M[r] def dot(v1, v2): return sum([x*y for x, y in zip(v1, v2)]) for i in range(R_n): for j in range (R_m): R[i][j] - dot(row(A,i), col(8,j)) return R 9. 10. 11. 12. 13. 14.