Question

please HELP! im implementing quicksort algorithm with the last element in the array as my pivot. but my output comes out to be in the same order as i put them in the array(not sorted at all!!). idk what im doing wrong. please help!

Answer 1

How did you implement your swap? What language is this in? Have you done any break points or prints to see what is happening at different parts of the process?

Answer 2

c++. the swap function is written there in the file.

Answer 3

OK, so is the swap function actually being called and if so is it actually swapping things?

Answer 4

I actually never tried breakpoints. I don't know how it works.

Answer 5

Those depends on the compiler. A few print statements or cout can be just as useful. For example, with a quicksort you are going to have recursive calls. OK. So have it output something every time it is recursively called.

Answer 6

ok. i fixed the swap part, along with the partition. now these two functions work perfectly. Te partition is now the problem right now.

Answer 7

and i just realized i never posted the file before in the first place. my brain...

Answer 8

i mean to say the quicksort* function is the problem.

Answer 9

Take a look at this version:
http://www.algolist.net/Algorithms/Sorting/Quicksort/Full

Answer 10

thx but i managed to fix the problem. now i just need to be able to change it up so it returns the index array, instead of the sorted elements.