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

Rank SortWrite an efficient parallel program that reads n integers from any input file and implements rank sort using p processors (p << n). Assume n is divisible by p.Given n integers stored in an array, rank sort computes rank of every a[j] as follows: Rank a[j] = no. of array elements that are ≤ a[j] for k = 0, 1, 2 … j-1 + no. of array elements that are < a[j] for k = j+1, j+2, j+3,… n – 1 Note: Every a[j] is compared with all array elements.
Implement the algorithm in C++. Algorithm: substring (s, p, len) Initialize i = p and count =0 Use an array „dest‟ to hold the required substring Repeat steps 4 ,5 and 6 while count <len dest[count] =s[i] count = count+1 i = i +1 Insert string terminator at end of dest Exit
1- Consider the following function: f (n) = 10n +2n -20 For which positive integer m can you say that: a- f(n) is O(n") b- f(n) is 2(n") c- f(n) is O(n") 2- Sort the following integer array into increasing order using Quick Sort algorithm : 20 15
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.
Algorithm A3: substring (s, ip, len)1. Initialize i = ip and count = 02. Use an array „dest‟ to hold the required substring3. Repeat steps 4 ,5 and 6 while count < len4. dest[count] = s[i]5. count = count +16. i = i + 17. Insert string terminator at end of dest8. Exit run the above algorithms in C/C++
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
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[i]) { temp = arr[j - 1]; arr[j - 1] = arr[j]; arr[j] = temp: 1. Based on the program above, please draw a control flow graph for it. 1. In your control flow graph, what are the test requirements for edge coverage? 1. List test path(s) that achieves the edge coverage. 1. 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. 1. In your control flow graph, what are the test requirements for edge-pair coverage? 1. List test paths that achieve the edge-pair coverage 1. 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.
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.
ALGORITHM Quicksort(A[l..r])//Sorts a subarray by quicksort//Input: Subarray of array A[0..n − 1], defined by its left and right// indices l and r//Output: Subarray A[l..r] sorted in nondecreasing order if l < r s = Partition(A[l..r]) //s is a split position Quicksort(A[l..s − 1]) Quicksort(A[s + 1..r]) The above code is the quicksort algorithm.Perform a time complexity analysis for quicksort. You need to explain 1) what makes a worst case, what makes a best case, 2) the time complexity for both the worst case and the best case, 3) how to avoid the worst case in practice.
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.