Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- template <typename T>
- int Partition(T list[], int s, int e){
- int p = e, j = s;
- for(int i=s;i<e;i++){
- if(list[i]<list[p]){
- swap(list[i],list[j]);
- ++j;
- }
- }
- swap(list[j],list[p]);
- return j;
- }
- template <typename T>
- void sort(T list[], int s, int e) {
- if(s < e) {
- int p = Partition(list, s, e);
- sort(list, s, p-1);
- sort(list, p+1, e);
- }
- }
- template<typename T> void swap(T* i, T* j) {
- T t = *i; *i = *j; *j = i;
- }
- template <typename T>
- void PrintArray(T list[], int arraySize){
- for(int i=0;i<arraySize;i++){
- cout<<list[i]<<" ";
- }
- cout<<endl<<endl;
- }
- template<typename T> void quickSort(T list[], int arraySize) {
- sort(list, 0, arraySize-1);
- }
- int main() {
- int list[10];
- cout<<"Enter 10 integers: ";
- for(int i=0;i<10;i++) {
- cin>>list[i];
- }
- quickSort(list, 10);
- cout<<"The sorted array is: ";
- PrintArray(list, 10);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement