a) Do the algorithms work totally or partially correctly (A then in ascending order sorted)? b) Do the algorithms work i

[answerhappygod]

a) Do the algorithms work totally or partially correctly (A then in ascending order sorted)?
b) Do the algorithms work in-place?
c) Are the algorithms comparison-based?
d) Are the algorithms stable?
e) What is the worst-case running time for the algorithms in the Landau calculus ̈l? In the following, assume that isSorted() and shuffleRandom() have a running time of O(n).
f) What is the best-case running time for the algorithms in the Landau calculus ̈l?
g) Bonus: What is the average-case running time of the algorithms in Landau-calculus?

A Do The Algorithms Work Totally Or Partially Correctly A Then In Ascending Order Sorted B Do The Algorithms Work I 1 (45.37 KiB) Viewed 20 times

the following two sorting algorithm are given. procedure GIANT SORT(A) EGET 1- Len(A) while ehdo if 130 and ALK AL then 2014 A [z], A [x = 13 = A[ 1-4) ALT 4-1 13 Sorted (4) do schschuffle Candom (4) 7 else end while return and procedure. procedure DUM SPORT (4) who while not end while end prace uve IG