diff options
author | admin@omencraft.com <admin@omencraft.com@0a769ca7-a7f5-676a-18bf-c427514a06d6> | 2011-11-04 17:27:11 +0100 |
---|---|---|
committer | admin@omencraft.com <admin@omencraft.com@0a769ca7-a7f5-676a-18bf-c427514a06d6> | 2011-11-04 17:27:11 +0100 |
commit | 563028f6dbaad33152a873ca68f4b619839a9589 (patch) | |
tree | 37de244a7e14441b58f55ad904e502e51f2ab163 /converter/quicksort.cpp | |
parent | Added cRedstone to project file (diff) | |
download | cuberite-563028f6dbaad33152a873ca68f4b619839a9589.tar cuberite-563028f6dbaad33152a873ca68f4b619839a9589.tar.gz cuberite-563028f6dbaad33152a873ca68f4b619839a9589.tar.bz2 cuberite-563028f6dbaad33152a873ca68f4b619839a9589.tar.lz cuberite-563028f6dbaad33152a873ca68f4b619839a9589.tar.xz cuberite-563028f6dbaad33152a873ca68f4b619839a9589.tar.zst cuberite-563028f6dbaad33152a873ca68f4b619839a9589.zip |
Diffstat (limited to '')
-rw-r--r-- | converter/cQuicksort.cpp (renamed from converter/quicksort.cpp) | 33 |
1 files changed, 6 insertions, 27 deletions
diff --git a/converter/quicksort.cpp b/converter/cQuicksort.cpp index 9bc1d477f..8a00805eb 100644 --- a/converter/quicksort.cpp +++ b/converter/cQuicksort.cpp @@ -1,21 +1,11 @@ -#include "quicksort.h" - +#include "cQuicksort.h" +#include <ctype.h> // Quicksort controller function, it partitions the different pieces of our array. -void quicksort(int *arIntegers, int left, int right) +void cQuicksort::quicksort(int *arIntegers, int left, int right) { -/* cout << "quicksort ([" << arIntegers[0] << "," - << arIntegers[1] << "," - << arIntegers[2] << "," - << arIntegers[3] << "," - << arIntegers[4] << "," - << arIntegers[5] << "," - << arIntegers[6] << "]," - << left << "," - << right << ")\n"; -*/ if (right > left) { int pivotIndex = median3(arIntegers,left,right); @@ -27,7 +17,7 @@ void quicksort(int *arIntegers, int left, int right) } } -int median3(int *arIntegers,int left,int right) +int cQuicksort::median3(int *arIntegers,int left,int right) { int center = (left+right)/2; @@ -45,18 +35,8 @@ int median3(int *arIntegers,int left,int right) // This function takes an array (or one half an array) and sorts it. // It then returns a new pivot index number back to quicksort. -int partition(int *arIntegers, int left, int right, int pivot) +int cQuicksort::partition(int *arIntegers, int left, int right, int pivot) { -/* cout << "partition ("<< arIntegers[0] << "," - << arIntegers[1] << "," - << arIntegers[2] << "," - << arIntegers[3] << "," - << arIntegers[4] << "," - << arIntegers[5] << "," - << arIntegers[6] << "]," - << left << "," - << right << ")\n"; -*/ int pivotValue = arIntegers[pivot]; // Swap it out all the way to the end of the array @@ -79,10 +59,9 @@ int partition(int *arIntegers, int left, int right, int pivot) } // Simple swap function for our in place swapping. -void swap(int &val1, int &val2) +void cQuicksort::swap(int &val1, int &val2) { int temp = val1; val1 = val2; val2 = temp; } - |