Related Setup: https://gist.github.com/hofmannsven/6814278
Related Pro Tips: https://ochronus.com/git-tips-from-the-trenches/
Related Setup: https://gist.github.com/hofmannsven/6814278
Related Pro Tips: https://ochronus.com/git-tips-from-the-trenches/
#include <iostream> | |
#include <vector> | |
#include <string> | |
using namespace std; | |
template <class T> | |
void print(T *arr, int n) { | |
for(register int i=0; i<n; i++) { | |
cout<<arr[i]<<" "; | |
} |
#include <iostream> | |
#include <vector> | |
#include <cmath> | |
using namespace std; | |
void print(int *arr, int n) { | |
for(register int i=0; i<n; i++) { | |
cout<<arr[i]<<" "; | |
} | |
cout<<"\n"; |
#include <iostream> | |
using namespace std; | |
void print(int *arr, int n) { | |
for(register int i=0; i<n; i++) { | |
cout<<arr[i]<<" "; | |
} | |
} | |
void bucketSort(int *arr, int n) { |
#include <iostream> | |
using namespace std; | |
int partition(int *, int, int); | |
void printArray(int *, int); | |
void quickSort(int *arr, int start, int end) { | |
if(start < end) { | |
int q = partition(arr, start, end); | |
quickSort(arr, start, q); |