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

find the minimum number between two entered number إجابتك
What is the decimal value of 24?
Convert below base5 number to base3 number (12341234)base 5
What is the index form for the following numbers 108 24 136 405 784
on Translate the lines marked by to Hex LDI R16, 10 LDI R29, 3* OR R16, R29* ASR R29* LDI R29, 3: OR R16, R29: ASR R29: 0x95AA 0x1805 0x957A 0x2BOD OxE0A1 OxE0C9 OxE045 0xE0D3 0x9540 0x908C OXOFOA Ox95D5 0xE057 OxE098 OxE075 0x9587 0x9583 OxEDE6 ONEOB4 09595 0x9553 0x2308 0x270E 0x230C 0x1B0B 0x95C7 0x95E0 0x0F07 0x2809 0x2704
Convert your last 5 digits of (1919300) number and hexadecimal number.
Convert from decimal to binary and show the method used please.
Find the standard form 0.000 000 000 000 000 000 000395
The hexadecimal values requested are in octal format.
Convert the base−ten number 348 to base−five.
Convert the number 7510 to base 7 using (a) division method and (b) subtraction method. Show all of your work.
numbers are in twos compliment