[Solved]1 First Let Us Look Timing 10pts Give Reasonable Explanation Selection Sort Algorithm O N2 Q37220507

1. First, let us look at some timing (10pts) Give a reasonable explanation as to why the Selection Sort algorithm is an O (N2) algorithm. [O(fx) implies that the algorithm carries out f(x) operations.] (5pts) Even though Selection Sort and Bubble Sort are both considered O(N2) algorithms, their timing can vary, suggest a reason why. (10pts) You have two algorithms that both operate on 600,000 data elements. The first algorithm is an O(N2) algorithm and takes 10 hours to run. The second algorithm is an O (Nlog2N)algorithm. How long does the second algorithm take to process the same 600,000 data elements. Show your work and give the result in seconds. [Assume the operations are the same.] a. b. c. Show transcribed image text 1. First, let us look at some timing (10pts) Give a reasonable explanation as to why the Selection Sort algorithm is an O (N2) algorithm. [O(fx) implies that the algorithm carries out f(x) operations.] (5pts) Even though Selection Sort and Bubble Sort are both considered O(N2) algorithms, their timing can vary, suggest a reason why. (10pts) You have two algorithms that both operate on 600,000 data elements. The first algorithm is an O(N2) algorithm and takes 10 hours to run. The second algorithm is an O (Nlog2N)algorithm. How long does the second algorithm take to process the same 600,000 data elements. Show your work and give the result in seconds. [Assume the operations are the same.] a. b. c.

Expert Answer

---

Answer to 1. First, let us look at some timing (10pts) Give a reasonable explanation as to why the Selection Sort algorithm is an … . . .