c++ 2Show the steps of bubble sort following the example of the solved problems on the handout for the algorithmand the format of your answer. Stop after the first pass with no swaps.2.12.2initial values 8 5 3 10 2i = 4i= 3i=2i=1initial values 40i = 4i=3i = 2i=142 -3 10 0 SortingThis handout explains three quadratic sorting algorithms. Each explanation assumes we are sorting an array of size n inascending order from position position [0] through [n-1]. (Technically, we should say "non-decreasing" rather than"ascending", since we could have duplicates.)Bubble SortAs was demonstrated in class, the main idea of bubble sort is as follows.■ Make n-1 passes through the array, numbered i=n-1, n-2, etc. down to 1On pass i, we consider the part of the array 0 through iWe walk through that part of the array, looking at each pair of adjacent elements, and swapping them ifthey are out of order.■▪ We also can keep track of whether any swaps happen during each pass. If we make a pass that has NOswaps at all, we can stop, because we know the array is already sorted.Some things we know about bubble sort:▪ After pass i, we know that the element in position i through the end of the array (n-1) is in proper place in thearray. (This was explained in lecture.)■ Corrolary 1: After pass 1, we know that elements 1 through n-1 are sorted and in their correct place in thearray.■Corrolary 2: After pass 1, we know the entire array is sorted, because it is not possible for element [0] tobe out of place if every other element is in place.Given this, here are two example "worked problems" for bubble sort.The part in bold is what YOU would write if given the problem.initial60 50 40 30 20valuesi=4 50 40 30 20 60i=3 40 30 20 50 60i=230 20 40 50 60i=1 20 30 40 50 60initialvalues10 40 3060 50i=41050 6050 60i=310 30 40i=2 DONE: no swaps on previous pass

Note: As per instructions, the step-by-step procedure/calculation for given values/array is shown…

Show the steps of bubble sort following the example of the solved problems on the handout for the algorithm and the format of your answer. Stop after the first pass with no swaps. 2.1 2.2 initial values 8 5 3 10 2 i=4 i=3 i = 2 i=1 initial values 40 42 -3 10 0 i=4 i=3 i=2 i=1

Show the steps of bubble sort following the example of the solved problems on the handout for the algorithm and the format of your answer. Stop after the first pass with no swaps. 2.1 2.2 initial values 8 5 3 10 2 i=4 i=3 i = 2 i=1 initial values 40 42 -3 10 0 i=4 i=3 i=2 i=1

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

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.
Consider a divide-and-conquer algorithm that calculates the sum of all elements in a set of n numbers by dividing the set into two sets of n/2 numbers each, finding the sum of each of the two subsets recursively, and then adding the result. What is the recurrence relation for the number of operations required for this algorithm? Answer is f(n) = 2 f(n/2) + 1. Please show why this is the case.
Implement a quicksort with a sample size of 2k 1. Sort the sample first, then have the recursive procedure partition on the sample's median and shift the two halves of the rest of the sample to each subarray so that they may be utilised in the subarrays without having to be sorted again. This algorithm is known as samplesort. Put into practise a quicksort based on a 2k sample. The sample should be sorted first, after which you should set up the recursive procedure to split the sample based on its median and to shift the two halves of the remaining sample to each subarray so they can be utilised in the subarrays without needing to be sorted again. The name of this algorithm is samplesort.
This is the illustration for the execution of the insertion-sort algorithm on the input sequence (12, 11, 13, 5, 6): look the picture sent Group of answer choices a) True b) False
Consider sorting n numbers stored in array A by first finding the smallest element of A and exchanging it with the element in A[1]. Then find the second smallest element of A, and exchange it with A[2]. Continue in this manner for the first n -1 elements of A. write pseudocode for this algorithm , which is known as selection sort. What loop invariant does this algorithm maintain? Why does it need to run for only the first n – 1 elements, rather than for all n elements? Give the best-case and worst-case running times of selection sort in Θ-notation.
The median m of a sequence of n elements is the element that would fall in the middle if the sequence was sorted. That is, e ≤ m for half the elements, and m ≤ e for the others. Clearly, one can obtain the median by sorting the sequence, but one can do quite a bit better with the following algorithm that finds the kth element of a sequence between a (inclusive) and b (exclusive). (For the median, use k = n/2, a = 0, and b = n.) select(k, a, b)Pick a pivot p in the subsequence between a and b.Partition the subsequence elements into three subsequences: the elements <p, =p, >p Let n1, n2, n3 be the sizes of each of these subsequences.if k < n1 return select(k, 0, n1).else if (k > n1 + n2) return select(k, n1 + n2, n).else return p. c++
While counting sort appears to have the best runtime, it is seldom ever implemented. Why is this the case? What is it about the algorithm that makes it practically undesirable? Be sure to back up your claims with relevant analysis and mathematical arguments.
Suppose that I searched for a number x in a sorted list of n items by comparing against the 5th item, then the 10th, then the 15th, etc. until I found an item bigger than x, and then I searched backwards from that point. Which expression best describes the approximate running time of this algorithm:
Which of the sorting algorithms you know from the lecture (Quicksort, Heapsort, Mergesort, Insertionort, Selectionsort, Bubblesort, Bucketsort, Radixsort) are stable and which are not? Here, to, a brief justification should be given in each case.
Create an algorithm that demonstrates the Fibonacci search procedure. The number of data elements n is chosen in such a way that: I Fk+1 > (n+1); and ii) Fk + m = (n +1) for some m 0, where Fk+1 and Fk are two consecutive Fibonacci numbers.
Quick sort the list L = {A, B, N, M, P, R}. What are your observations? How canthe observations help you in determining the worst-case complexity of quick sort?
Question 1) Implement Merge sort and Quick sort on a programming language of your choice. Evaluate their performance for the following input sizes:1)1002)10003) 10000004) 100000005) 1000000000You need fill the following table with the running times of each algorithm on your pc, the TABLE IS SHOWN IN THE IMAGE, PLEASE DO NOT ANSWER IF YOU CANNOT FILL IT.