Aptitude - Which sorting has the same average and worst time complexity?A, QuickB. BubbleC. Merge

GeekInterview.com > Placement Papers > IBM > Aptitude

Go To First | Previous Question | Next Question

Aptitude | Question 84 of 124

Which sorting has the same average and worst time complexity?
A, Quick
B. Bubble
C. Merge

Total Answers and Comments: 4

Last Update: November 08, 2008

Sponsored Links

Best Rated Answer

—

Submitted by: supraja

MERGE SORT

Above answer was rated as good by the following members:
kallam86

March 09, 2006 01:19:44

supraja

RE: Which sorting has the same average and worst ...

MERGE SORT

Is this answer useful? Yes | No

1 0

Overall Rating: +1

August 03, 2006 03:17:40

anithakoutharapu

Member Since: June 2006 Contribution: 2

RE: Which sorting has the same average and worst ...

Bubble sort

Is this answer useful? Yes | No

December 05, 2006 03:47:02

poorvi

RE: Which sorting has the same average and worst ...

Its Merge sort having a worst and an average complexity of nlog(n)

Is this answer useful? Yes | No

November 08, 2008 09:12:13

Nadal

Member Since: November 2008 Contribution: 2

RE: Which sorting has the same average and worst time complexity?A, QuickB. BubbleC. Merge

Average time complexity using quick sort is n lgn

Worst case time complexity using quick sort is n^2

Average time complexity using merge sort is n lgn

Worst case time complexity using merge sort is n lgn

Is this answer useful? Yes | No

Go To Top

User Name		Remember Me?
Password

Question Bank