Answered Essay: Question is from algorithams analysis & design course

Question is from algorithams analysis & design course

3. Consider the following sorting algorithm (the UNH sort) to sort an array A[1..n].

for i = n-1 downto 1 do

for j = 1 to i do

if A[j] > A[j+1] then

swap(A[j],A[j+1])

(a) Trace this sorting algorithm on the list 6,3,7,5,9,2 i.e. show what the list looks like after each iteration of the outer loop. Also, calculate the exact number of total data comparisons made.

(b) Do a worst case analysis (use big O notation) of the running time of this algorithm. give the explanation and final answer.

(c) Do a best case analysis (use big O notation) of the running time of this algorithm. give the explanation and final answer.

Expert Answer

 

for i = n-1 downto 1 do
for j = 1 to i do
if A[j] > A[j+1] then
swap(A[j],A[j+1])

6,3,7,5,9,2 (Original Array)
First Pass => 6 > 3 , Swap 3,6,7,5,9,2 , 7 > 5 , Swap 3,6,5,7,9,2 , 9 > 2 , Swap 3,6,5,7,2, 9
3,6,5,7,2,9
Second Pass => 6 > 5 , Swap 3,5,6,7,2,9 , 7 > 2 , Swap 3,5,6,2,7,9
3,5,6,2,7,9
Third Pass => 6 > 2 , Swap 3,5,2,6,7,9
3,5,2,6,7,9
Fourth Pass => 5 > 2 , Swap 3,2,5,6,7,9
3,2,5,6,7,9
Fourth Pass => 3 > 2 , Swap 2,3,5,6,7,9

Total Number of comparison made : N = 6
First paas we made 5 comparision ,
Second paas we made 4 comparision ,
Third paas we made 3 comparision ,
Fourth paas we made 2 comparision ,
Fifth paas we made 1 comparision

i.e 6 +5 + 4+ 3 +2 +1 = 21

b) Worst Case time complexity depends on number of comparision
=> n(n-1)/2
=> T(n) = O(n2)

c) Best case will occur if the array is sorted i.e 1 2 3 4 5 , if condition wont be satisfied
Thats the best case i.e T(n) = O(n)

Buy Essay
Calculate your paper price
Pages (550 words)
Approximate price: -

Help Me Write My Essay - Reasons:

Best Online Essay Writing Service

We strive to give our customers the best online essay writing experience. We Make sure essays are submitted on time and all the instructions are followed.

Our Writers are Experienced and Professional

Our essay writing service is founded on professional writers who are on stand by to help you any time.

Free Revision Fo all Essays

Sometimes you may require our writers to add on a point to make your essay as customised as possible, we will give you unlimited times to do this. And we will do it for free.

Timely Essay(s)

We understand the frustrations that comes with late essays and our writers are extra careful to not violate this term. Our support team is always engauging our writers to help you have your essay ahead of time.

Customised Essays &100% Confidential

Our Online writing Service has zero torelance for plagiarised papers. We have plagiarism checking tool that generate plagiarism reports just to make sure you are satisfied.

24/7 Customer Support

Our agents are ready to help you around the clock. Please feel free to reach out and enquire about anything.

Try it now!

Calculate the price of your order

Total price:
$0.00

How it works?

Follow these simple steps to get your paper done

Place your order

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Receive the final file

Once your paper is ready, we will email it to you.

HOW OUR ONLINE ESSAY WRITING SERVICE WORKS

Let us write that nagging essay.

STEP 1

Submit Your Essay/Homework Instructions

By clicking on the "PLACE ORDER" button, tell us your requires. Be precise for an accurate customised essay. You may also upload any reading materials where applicable.

STEP 2

Pick A & Writer

Our ordering form will provide you with a list of writers and their feedbacks. At step 2, its time select a writer. Our online agents are on stand by to help you just in case.

STEP 3

Editing (OUR PART)

At this stage, our editor will go through your essay and make sure your writer did meet all the instructions.

STEP 4

Receive your Paper

After Editing, your paper will be sent to you via email.