[Solved]Q1 Sorting Algorithms Using Selection Sort Implement One Sorting Algorithms Seen Lecture J Q37107149

Q1. Sorting algorithms:(Using selection sort)Implement one of the sorting algorithms that we have seen in thelecture
in Java. Run it on a wide range of examples to see if the formalanalysis is a good predictor of
each algorithm’s behavior in practice. The steps of a test scenarioare as follows:

a) You will need to use in each iteration an array of numbers ofsize n that you will sort.
The value of n will be different from one iteration to another(e.g., 10, 20, 30,…, 9990).
The elements of the array will be random values between 0 and 1000.(empirical
analysis)

b) In each execution of the sorting algorithm, you will have torecord the amount of time
it takes to sort the array. Then, you will have to plot (in Excelor any other plotting
program), the execution time as a function of n. Visit thefollowing link to see how you
can measure the execution time of a method:https://howtodoinjava.com/java/datetime/
execution-elapsed-time/

c) For the same values of n that you used in a), plot thetheoretical function corresponding
to the order of the sorting algorithm and draw the conclusion bycomparing the
empirical results with what the theoretical analysis predicts.

————————————————————————————————————————
Q2. Binary search. Implement binary search algorithm that we haveseen in the lecture in
Java. Run it on a wide range of examples to see if the formalanalysis is a good predictor of
the algorithm’s behavior in practice. The steps of a test scenarioare as follows:

a) You will need to use in each iteration an array of numbers ofsize n. The value of n
will be different from one iteration to another (e.g., 10, 20,30,…, 9990). The elements
of the array will be random values between 0 and 1000. The key willbe a random
number between 0 and 1100. (empirical analysis)

b) In each execution of the algorithm, you need to record theamount of time it takes to
find out if the key is in the array. Then, you will have to plot(in Excel or any other
plotting program), the execution time as a function of n. Visit thefollowing link to see
how you can measure the execution time of a method:
https://howtodoinjava.com/java/date-time/execution-elapsed-time/

c) For the same values of n that you used in a), plot thetheoretical function corresponding
to the order of the binary search algorithm and draw the conclusionby comparing the
empirical results with what the theoretical analysis predicts.

Expert Answer

---

Answer to Q1. Sorting algorithms:(Using selection sort) Implement one of the sorting algorithms that we have seen in the lecture i… . . .