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 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?

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

35. A particular sorting algorithm takes integer list 10, 6, 8 and incorrectly sorts the list to 6, 10, 8. What is true about the algorithm's correctness for sorting an arbitrary list of three integers? A.The algorithm is correct. B.The algorithm is incorrect. C.The algorithm's correctness is unknown. D.The algorithm only works for 10, 6, 8.
Q1: Suppose you are given an array A of n Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.
Q1)Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm. Q2)Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. Write the mathematical process to find the missing number, i.e. some equation. What is the time complexity of finding the missing number in the sequence? Q3)Sort the text “SARHAD UNIVERSITY” in ascending order using the insertion sort algorithm. Discuss also the best, worst and average case complexity of the…
The code fragment above contains an implementation of one of the sorting algorithms that was discussed in class and a list of integers named my_list. If this algorithm were called to sort my_list then what would be the contents of that list after 4 iterations of the outermost loop of that algorithm? This question is internally recognized as variant 232. Q8) [18, 25, 36, 45, 14, 58, 47, 19, 21, 54, 64, 44, 66, 27, 67, 15, 65, 50, 68, 69] [14, 15, 18, 19, 21, 25, 27, 36, 44, 45, 47, 50, 54, 58, 64, 65, 66, 67, 68, 69] [14, 15, 25, 45, 36, 58, 18, 66, 47, 19, 21, 54, 69, 44, 68, 27, 67, 64, 65, 50] [18, 64, 25, 45, 36, 58, 14, 66, 47, 19, 21, 54, 69, 44, 68, 27, 67, 15, 65, 50] [18, 25, 45, 36, 58, 14, 64, 47, 19, 21, 54, 66, 44, 68, 27, 67, 15, 65, 50, 69] [14, 15, 18, 45, 36, 58, 25, 66, 47, 19, 21, 54, 69, 44, 68, 27, 67, 64, 65, 50] [14, 15, 18, 19, 21, 58, 25,…
Assume you have a sorted list of 100 pre-sorted elements and a recursive implementation of Quicksort. How many calls to Quicksort are made in order to fully sort it. Assume that the algorithm makes the recursive Quicksort calls before checking if it has an array of size 1 (see https://www.geeksforgeeks.org/quick-sort/ for specific pseudo code or the textbook Introduction to Algorithms 3rd Edition page 171). 85 101 50 103 199 Assume you have the following array: 40, 20, 15, 40, 90, 60, 50, 70. Which of the following elements, if selected as the pivot, would give you the most unequal sub-arrays to be sorted using quicksort? 30, 70 20, 15 40, 90 90, 70 90, 15 Assume you have the following array: 40, 20, 15, 40, 90, 60, 50, 70. Which of the following elements, if selected as the pivot, would give you the most unequal sub-arrays to be sorted using quicksort? 30, 70 20, 15 40, 90 90, 70 90, 15 Assume we have the array 4,10,3,5,1,2,5,6,1,2,3. What are the swaps that will occur after we…
A list is given an = {6,2,-4,13,7} Answer the following questions. a. What is n in an? b. List all the steps of sorting this list using insertion sort. c. What is the output of this search? And what does it indicate?
Given these 8 numeric values to be sorted using the recursive Mergesort algorithm: 92 63 24 18 69 27 64 43 The list that will be passed to the first call of the Mergesort algorithm will be the entire list of values above. Show the list that will be passed to the 5th call of the Mergesort algorithm.
the list has the following items 17 9 11 30 8 20 35 7 5 45 3 28 Apply the quick sort on the above list by using the pivot is always the left item and find the following The list after a first partition call
Quick Sort is another sorting algorithm that follows a divide-and-conquer approach. The algorithm can be summarized in 3 steps: A pivot element is chosen, usually the first element. All elements smaller than the pivot are placed to the left of the pivot. This creates 2 partitions, elements greater than the pivot and elements less than the pivot. The 2 partitions are sorted using Quick Sort. Sample code in python3: def quick_sort(arr): def quick_sort_r(arr, start, end): if end - start < 2: # single element base case return # choose a pivot pivot = start # you may choose other elements store = pivot+1 # index to store less than elements # for all elements after the pivot for i in range(pivot+1, end): if arr[i] < arr[pivot]: # if element is less than pivot arr[i], arr[store] = arr[store], arr[i] # swap store += 1 # increment store index # swap pivot with last element in less than…
Q: Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.
PYTHON def _insertionsort(self, order): # Implements the insertion sort algorithm to sort a list of items in ascending or descending order n = len(self.items) for i in range(1, n): key = self.items[i] j = i - 1 if order == 'asc': while j >= 0 and key < self.items[j]: self.items[j + 1] = self.items[j] j -= 1 self.items[j + 1] = key elif order == 'desc': while j >= 0 and key > self.items[j]: self.items[j + 1] = self.items[j] j -= 1 self.items[j + 1] = key def sort(self, order = 'asc', type = 'insertion'): if type == 'insertion': # call the insertions sort method to sort atos array based on the parameter values #######################################################################
Quicksort has several optimization strategies that we discussed in class. Select a valid one from the list below. (could be more than one) Always divide the input exactly in half in the first step, then adjust afterwards. Use recursion for larger files of similar data ranges. Use merge sort for sub-partitions. Use insertion sort for small partitions.