ALGORITHM BubbleSort(A[0..n – 1]) I/Sorts a given array by bubble sort //Input: An array A[0..n – 1] of orderable elements //Output: Array A[0..n – 1] sorted in nondecreasing order for i +0 to n – 2 do for j0 to n – 2- i do if A[j+1] < A[j] swap A[j]and A[j+1] a) Demonstrate the steps based on the algorithm above for the following lists: List 1: 3, 7, 8, 9, 10

ALGORITHM BubbleSort(A[0..n – 1]) I/Sorts a given array by bubble sort //Input: An array A[0..n – 1] of orderable elements //Output: Array A[0..n – 1] sorted in nondecreasing order for i +0 to n – 2 do for j0 to n – 2- i do if A[j+1] < A[j] swap A[j]and A[j+1] a) Demonstrate the steps based on the algorithm above for the following lists: List 1: 3, 7, 8, 9, 10

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

Write the code of MergeSort algorithm using JAVA programming language. Assume your array continues 8 unsorted numbers. Hint: Array[] = 56, 4 , 44, 6, 5, 32, 60, 2 Change the array as you want.
Executable C++ program shown in Figure Q2(c) is executing insertion and deletion algorithms by using array data structure. Write the complete output after the program execution. #include using namespace std; class InsDel { private: int Array[]; public: void gen_array(); void disp_array(); void insertion (int ,int ); void deletion (int ); }; void InsDel::gen_array () { for (int i = 0; i < 8; i++) { Array[i] = i*2; void InsDel::disp_array () for (int i = 0; i < 8; i++) { cout « "Arr[" « i « "]: " « Array[i] « endl; Continue...
The worst case of insertion sort happens when: a. None of them O b. The array is sorted in reversed order O. The array is sorted in ascending order O d. The array is randomly sorted
The last index numbers of an array of size NxM will be: [N-1][M-1] [N][M] 2NM None of the answers are correct.
Write a program that fills a unary array ar[4] with four random integers between [1 to 10] Ex: 4 7 ar Then the program creates a 4*4 matrix based on the values in {ar} and print it 11 6. 7 8 6. 4 7 3 -2 -4 5.
The given array is arr = {1,2,3,4,5). (bubble sort is implemented with a flag variable) The number of iterations in selection sort and bubble sort respectively are, O 0 and 4 Skip O1 and 4 O 5 and 4 O4 and 1
Consider the Insertion Sort Function below:public static void insertionSort(int array[]){ int n = array.length; for (int j = 1; j < n; j++) { int key = array[j]; int i = j-1; while ( (i > -1) && ( array [i] > key ) ) { array [i+1] = array [i]; i--; } array[i+1] = key;} }Discuss when is its best case, and worst case performance.
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
231For the given array, find the kth largest element.** Note: Sorting is not allowed5Input format:Input:321564line 1 consist of array elements, separated by a spaceline 2 consist of k valueEg:output:Input:111output:
Background for Question 14-20: Below is a bubble sort program that sorts the elements in an array. static void bubbleSort(int] arr) { int n = arr.length; int temp = 0; for (int i = 0; i arr[]) { temp = arrj - 1]: arrj - 1] = arr[i]: arrj) = temp; } } Based on the program above, please draw a control flow graph for it. In your control flow graph, what are the test requirements for edge coverage? 2. 1. List test path(s) that achieves the edge coverage. 3. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason. 4. In your control flow graph, what are the test requirements for edge-pair coverage? 5. List test paths that achieve the edge-pair coverag. 6. Provide test cases for each test path you list in the previous question. If it is not possible to find the test input for certain test path, describe the reason.
use python to solve this question
Question # 02: Let’s assume we want to find the largest number in a non-empty array A. A sample solution can be following: def max(A): answer = A[0] for j in range(1,len(A)): // in pseudo-code: for i=1,...,len(A)-1 if (A[j]>answer): answer = A[j] return answer Perform the code correction check including the loop invariance. Question # 03: illustrate the operation of merge sort on the array A = {3; 41; 52; 26; 38; 57; 9; 49}. Question # 04: Answer the following short questions: a) Is 2n+1 = O(2n)? b) Is 22n = O(2n)? c) f(n)=O(g(n)) implies g(n)=O(f(n)) d) f(n) = O((f(n))2)