BaseLibraries/CClasses
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/myhelpers.git synced 2025-12-06 18:43:59 -05:00
Code Issues Packages Projects Releases Wiki Activity

Changed everything to bubbleSort because

Browse Source 
quickSort was causing a stack overflow
This commit is contained in:
Matthew Ellison
2019-03-11 12:23:32 -04:00
parent 4367c34874
commit 0006517e74
1 changed files with 3 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
Algorithms.h
View File

@@ -120,7 +120,7 @@ struct DynamicInt64Array getPrimes(int64_t goalNumber){
} }
} }
quickSortDynamicInt64Array(&primes); bubbleSortDynamicInt64Array(&primes);
return primes; return primes;
} }
@@ -162,7 +162,7 @@ struct DynamicInt64Array getNumPrimes(int64_t numberOfPrimes){
} }
//The numbers should be in order, but sort them anyway just in case //The numbers should be in order, but sort them anyway just in case
quickSortDynamicInt64Array(&primes); bubbleSortDynamicInt64Array(&primes);
return primes; return primes;
} }
@@ -183,7 +183,6 @@ struct DynamicInt64Array getFactors(int64_t goalNumber){
++cnt; ++cnt;
} }
} }
//If it didn't find any factors in the primes the number itself must be prime //If it didn't find any factors in the primes the number itself must be prime
if(factors.size == 0){ if(factors.size == 0){
pushBackDynamicInt64Array(&factors, goalNumber); pushBackDynamicInt64Array(&factors, goalNumber);
@@ -227,7 +226,7 @@ struct DynamicInt64Array getDivisors(int64_t num){
} }
} }
//Sort the vector for neatness //Sort the vector for neatness
quickSortDynamicInt64Array(&divisors); bubbleSortDynamicInt64Array(&divisors);
//Return the vector of divisors //Return the vector of divisors
return divisors; return divisors;