Implement Quick sort algorithm with partition of 3 elements

Implement Quick sort algorithm with partition of 3 elements, partition of 5 elements, partition of 7 elements, partition of 9 elements and partition of 11 elements for the data set of 10000 elements.

Can anyone tell me what is meant by "partition" in the above?

mushahidh

Newbie Poster

6 posts since Oct 2010

Reputation Points: 10

Solved Threads: 0

1 Year Ago

Can anyone tell me what is meant by "partition" in the above?

It's the partition step of quicksort. If you don't know what that means, you need to do some research and learn how quicksort works. Otherwise an implementation is impossible without stealing code and hoping it's correct.

Narue

Bad Cop

Administrator

15,460 posts since Sep 2004

Reputation Points: 6,464

Solved Threads: 1,401

1 Year Ago

Show Comments

http://en.wikipedia.org/wiki/Quicksort

rubberman

Posting Virtuoso

1,554 posts since Mar 2010