assuming ID is 1542553 UH ID:Consider the in-place sorting algorithm MySort.Algorithm MySort1: function MYSORT(arr)Input An array arr of n elements.Output > Nonefor i +1 to n- 1 do2:j+i-1while j 2 0 and arr[j] > arr[j+ 1] dotemp + arr[j]arrlj] + arrlj + 1]arr[j + 1] + tempj+j-13:4:5:6:7:8:(i) Consider your 7-digit UH ID. How many comparisons (among array elements) doesMySort perform to sort the digits in your UH ID? Justify your answer.(ii) If the input array has n elements, how many comparisons does the algorithm performin the worst case? What is the input that achieves this worst case? Justify youranswer.(iii) If the input array has n clements, how many comparisons does the algorithm performin the best case? What is the input that achieves this best case? Justify youranswer.(iv) A stable sorting algorithm is one in which elements with the same value remain inthe same relative order after the sort is complete. For example, if A = [2,5, 4, 5, 1].a stable sort would output [1, 2, 4, 5, 5). Notice that the red 5 and the blue 5 occurin the same relative order before and after the array is sorted.Is MySort a stable sorting algorithm? Justify your answer.(v) Prove the correctness of MySort using mathematical induction.

Actually, python is a easiest programming language. It is a platform independent.

UH ID: Consider the in-place sorting algorithm MySort. Algorithm MySort 1: function MYSORT(arr) Input An array arr of n elements. Output > None for i+1 to n- 1 do j+i-1 2: 3: while j 20 and arr[j] > arr[j+ 1] do 4: temp + arrlj) arrlj] + arrlj + 1] + 1] + temp j+j-1 5: 6: 7: 8: (1) Consider your 7-digit UH ID. How many comparisons (among array elements) does MySort perform to sort the digits in your UH ID? Justify your answer. (ii) If the input array has n elements, how many comparisons does the algorithm perform in the worst case? What is the input that achieves this worst case? Justify your answer. (iii) If the input array has n elements, how many comparisons does the algorithm perform in the best case? What is the input that achieves this best case? Justify your answer. (iv) A stable sorting algorithm is one in which elements with the same value remain in the same relative order after the sort is complete. For example, if A = [2,5, 4, 5, 1). a stable sort would output [1, 2, 4, 5, 5]. Notice that the red 5 and the blue 5 occur in the same relative order before and after the array is sorted. Is MySort a stable sorting algorithm? Justify your answer. (v) Prove the correctness of MySort using mathematical induction.

UH ID: Consider the in-place sorting algorithm MySort. Algorithm MySort 1: function MYSORT(arr) Input An array arr of n elements. Output > None for i+1 to n- 1 do j+i-1 2: 3: while j 20 and arr[j] > arr[j+ 1] do 4: temp + arrlj) arrlj] + arrlj + 1] + 1] + temp j+j-1 5: 6: 7: 8: (1) Consider your 7-digit UH ID. How many comparisons (among array elements) does MySort perform to sort the digits in your UH ID? Justify your answer. (ii) If the input array has n elements, how many comparisons does the algorithm perform in the worst case? What is the input that achieves this worst case? Justify your answer. (iii) If the input array has n elements, how many comparisons does the algorithm perform in the best case? What is the input that achieves this best case? Justify your answer. (iv) A stable sorting algorithm is one in which elements with the same value remain in the same relative order after the sort is complete. For example, if A = [2,5, 4, 5, 1). a stable sort would output [1, 2, 4, 5, 5]. Notice that the red 5 and the blue 5 occur in the same relative order before and after the array is sorted. Is MySort a stable sorting algorithm? Justify your answer. (v) Prove the correctness of MySort using mathematical induction.

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

Java Insertion Sort but make it read the data 12, 11, 13, 5, 6 from a file not an array // Java program for implementation of Insertion Sort public class InsertionSort { /*Function to sort array using insertion sort*/ void sort(int arr[]) { int n = arr.length; for (int i = 1; i < n; ++i) { int key = arr[i]; int j = i - 1; /* Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current position */ while (j >= 0 && arr[j] > key) { arr[j + 1] = arr[j]; j = j - 1; } arr[j + 1] = key; } } /* A utility function to print array of size n*/ static void printArray(int arr[]) { int n = arr.length; for (int i = 0; i < n; ++i) System.out.print(arr[i] + " "); System.out.println(); } // Driver method…
Java Selection Sort but make it read the data 64, 25, 12, 22, 11 from a file not an array // Java program for implementation of Selection Sort class SelectionSort { void sort(int arr[]) { int n = arr.length; // One by one move boundary of unsorted subarray for (int i = 0; i < n-1; i++) { // Find the minimum element in unsorted array int min_idx = i; for (int j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element with the first // element int temp = arr[min_idx]; arr[min_idx] = arr[i]; arr[i] = temp; } } // Prints the array void printArray(int arr[]) { int n = arr.length; for (int i=0; i<n; ++i) System.out.print(arr[i]+" "); System.out.println(); } // Driver code to test above public…
Python Numpy Function to complete: def w14(v): Inputs: v: A numpy array of shape (N, 1) Returns: The L2 norm of v: norm = (sum_i^N v[i]^2)^(1/2) You MAY NOT use np.linalg.norm
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 :
ALGO2(A)// A is an integer array, index starting at 11:for i=1 to n-1 do2: for j=n to i+1 do3: if (A[j] < A[j-1]) then4: exchange A[j] with A[j-1] Which function best describes the worst-case running time behaviour of ALGO2 on an array of size n? Option 1) a*(n^2) + b*n +c, where a,b,c are constantsOption 2) a*n + b , where a and b are constantsOption 3) a * n * log(n) + b, where a,b are constantsOption 4) a*(n^3) + b*(n^2) + c*n + d, where a,b,c,d are constants
function Sum(A,left,right) if left > right: return 0else if left = right: return A[left] mid = floor(N/2) lsum = Sum(A,left,mid) rsum = Sum(A,mid+1,right) return lsum + rsum function CreateB(A,N)B = new Array of length 1 B[0] = Sum(A,0,N-1) return B Building on the above, in a new scenario, given an array A of non-negative integers of length N, additionally a second array B is created; each element B[j] stores the value A[2*j]+A[2*j+1]. This works straightforwardly if N is even. If N is odd then the final element of B just stores A[N-1] as we can see in the figure below: (added in image) The second array B is now introducing redundancy, which allows us to detect if there has been a hardware failure: in our setup, such a failure will mean the values in the arrays are altered unintentionally. The hope is that if there is an error in A which changes the integer values then the sums in B are no longer correct and the algorithm says there has been an error; if there were an error in B…
Pseudo Code shown in Figure Q1(a) is an algorithm for binary searching for an array with n number of elements. By applying this algorithm, show step by step approach on how to find number 11 in an array as depicted in Figure Q1(b). low + 0 high e n-1 while (low s high) do ix + (low + high) /2 if (t = Alix)) then return ix else if (t < A[ix]) then high e ix - 1 else low + ix + 1 return -1 Figure Ql(a) 2 4 6 9 11 12 | 25 [0] [1) [2] [3] (4) [5) [6] Figure Q1(b)
Language: Python 3 • Autocomplete Ready O 1 v import ast lst = input(O lst = ast.literal_eval(lst) def binarysearch(lst,x,low,high): if low - high x: 10 11 Algorithm BinarylnsertionSort 12 Input/output: takes an integer array a = {a[0], ..., a[n – 1]} of size n 13 begin BinarylnsertionSort return binarysearch (lst, x, mid, high) 14 for i =1 to n val = a[i] p = BinarySearch(a, val, 0, i – 1) for j = i-1 to p alj + 1]= a[j] j= j-1 end for 15 else: 16 return mid 17 18 def BinaryInsertionSort(lst): 19 print (BinaryInsertionSort(lst)) 20 a[p] = val j=i+1 end for end BinarylnsertionSort Here, val = a[i] is the current value to be inserted at each step i into the already sorted part a[0], ..., ați – 1] of the array a. The binary search along that part returns the position p where the val will be inserted. After finding p, the data values in the subsequent positions j = i- 1, ..., p are sequentially moved one position up to i, ..., p+1 so that the value val can be inserted into the proper…
Language: Python 3 Autocomplete Ready O 1 v import ast 3. Hybrid Sort input() lst %3D 3 lst = ast.literal_eval(lst) 4 Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. In each iteration, insertion sort inserts an element into an already sorted list (on left). The position where the item will be inserted is found through linear search. You decided to improve insertion sort by using binary search to find the position p where the new insertion should take place. 6 print(BinaryInsertionSort(lst)) Algorithm BinarylnsertionSort Input/output: takes an integer array a = {a[0], ..., a[n – 1]} of size n begin BinarylnsertionSort for i =1 to n val = a[i] p = BinarySearch(a, val, 0, i – 1) for j = i-1 to p a[j + 1]= a[i] j= j-1 end for a[p] = val i i+1 end for end BinarylnsertionSort Here, val = a[i] is the current value to be inserted at each step i into the already sorted part a[0], ..., ați – 1] of the array a. The binary search along that part…
int g(int nums[], int n) { if (n == 1) return 0; int val = g(nums, n-1); if (nums[n-1] > nums[val]) return val; return n-1; } Give a recurrence T(n) for the number of times the code nums[n-1] > nums[val] is executed when the array values are in ascending order. Then solve the recurrence
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
Java Bubble Sort but make it read the data 64, 34, 25, 12, 22, 11, 90 from a file not an array // Java program for implementation of Bubble Sort class BubbleSort { void bubbleSort(int arr[]) { int n = arr.length; for (int i = 0; i < n - 1; i++) for (int j = 0; j < n - i - 1; j++) if (arr[j] > arr[j + 1]) { // swap arr[j+1] and arr[j] int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } /* Prints the array */ void printArray(int arr[]) { int n = arr.length; for (int i = 0; i < n; ++i) System.out.print(arr[i] + " "); System.out.println(); } // Driver method to test above public static void main(String args[]) { BubbleSort ob = new BubbleSort(); int arr[] = { 64, 34, 25, 12, 22, 11, 90 }; // make it read from a file instead of having…