Data Structures - What is the difference between bubble sort & quick sort?

GeekInterview.com > Interview Questions > Concepts > Data Structures

Go To First | Previous Question | Next Question

Data Structures | Question 154 of 202

What is the difference between bubble sort & quick sort?

Total Answers and Comments: 4

Last Update: August 17, 2009 Asked by: nandhini

Sponsored Links

Best Rated Answer

—

Submitted by: GCTHere

Bubble sort is easy to program, slower, iterative. Compares neighboring numbers swaps it if required and continues this procedure until there are no more swaps

Quick Sort is little difficult to program, Fastest, Recursive. Pivot number is selected, other numbers are compared with it and shifted to the right of number or left depending upon criteria again this method is applied to the left and right list generated to the pivot point number. Select pivot point among that list.

Above answer was rated as good by the following members:
aman15490, Bandara07

December 12, 2006 03:50:17

mahesh

RE: What is the difference between bubble sort & quick...

Bubble sort is a sort in which at each pass highest value is taken to right

Quick sort is a sort in which pivot is chosen and all the elements less than pivot are kept to left and elements greater than pivot are kept to right

Is this answer useful? Yes | No

February 05, 2007 08:13:39

GCTHere

RE: What is the difference between bubble sort & quick...

Bubble sort is easy to program slower iterative. Compares neighboring numbers swaps it if required and continues this procedure until there are no more swaps

Quick Sort is little difficult to program Fastest Recursive. Pivot number is selected other numbers are compared with it and shifted to the right of number or left depending upon criteria again this method is applied to the left and right list generated to the pivot point number. Select pivot point among that list.

Is this answer useful? Yes | No

1 0