quick sort algorithm using middle element as pivot

Shuvradip Sarma

here is the code- public static int partition(int array[],int start,int end) { int pivot_index=(start+end)/2; int pivot=array[pivot_index]; int i=start; int j=end; while(ipivot) { j--; } if(i

Richard Deeming

Read the red text at the top of this page: No programming questions in the Lounge. 2) You have already posted this in QA: Cannot implement quick sort algorithm using pivot as middle element.how do I solve it?[^] 3) You still haven't fixed the problem with what you posted in QA - namely, the code you have pasted is corrupt and incomplete.

"These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

OriginalGriff

Even if that was complete, and formatted, and top quality code ... why are you posting it here? We all wrote bubble sort, quicksort, double bubble, and such like when we were students. We pretty much don't write them now because we have optimised versions in libraries that we "just call" - there are exceptions, but they tend to be both rare and specialized and that code is neither - so why would we be interested in it. Unless it doesn't work, and you need help - in which case it's rather rude of you to just ignore the writing in read at the top of the page ...

"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony "Common sense is so rare these days, it should be classified as a super power" - Random T-shirt AntiTwitter: @DalekDave is now a follower!

Rage

Please sort yourself and sort this code out.

Do not escape reality : improve reality !

Dave Kreskowiak

So are you going to listen to the comments on the other copy of this you posted? If not, you're not going to get anywhere on your assignment.

Asking questions is a skill CodeProject Forum Guidelines Google: C# How to debug code Seriously, go read these articles.
Dave Kreskowiak