#include #include #include using namespace std; //sort using bubble sort algorithm //complexity : O(log(n)(log(n)+1)/2) //I put this one as a simple example of how to do it without containers as the algorithm is really simple int sorting_bubble(int n); //sort using quick sort algorithm //complexity : O(log(n)*log(log(n))+log(n)) //quickest sorting algorithm I know int quick_sort(int n); //In those complexity calculations, there are log(n) everywhere as it is approximately the number of digits int main() { int n; srand(time(0)); cout<<"|---- BUBBLE SORT ----|\n"; for(int i=0;i<5;++i){ n=rand(); cout< "< "<=1){ j=1; while(j<=i){ if(n/j%10 > n/(j*10)%10){ n=n-(n/j%100*j)+(n/j%10*(j*10))+(n/(j*10)%10*j); } j*=10; } i/=10; } return n/10; } int pivot(int n,unsigned int& begin, unsigned int end){ if(begin n/(begin*10)%10){ //swap n=n-n/begin%100*begin+n/(begin*10)%10*begin+n/begin%10*(begin*10); begin*=10; }else{ n=n-n/(begin*10)%10*begin*10-n/end%10*end+n/(begin*10)%10*end+n/end%10*(begin*10); end/=10; } return pivot(n,begin,end); } return n; } int R_quick_sort(int n,unsigned int begin,unsigned int end){ unsigned int mid; if(begin<=end){ mid=begin; n=pivot(n,mid,end); n=R_quick_sort(n,begin,mid/10); return R_quick_sort(n,mid*10,end); } return n; } int quick_sort(int n){ unsigned end=1; while(end<=n){ end*=10; } return R_quick_sort(n,1,end/10); }

Challenge : sort the figures