Advertisement
homeworkhelp111

Untitled

Apr 14th, 2023
20
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.94 KB | None | 0 0
  1. #include<iostream>
  2.  
  3. using namespace std;
  4.  
  5. template <typename T>
  6. int Partition(T list[], int s, int e){
  7.  
  8. int p = e, j = s;
  9. for(int i=s;i<e;i++){
  10. if(list[i]<list[p]){
  11. swap(list[i],list[j]);
  12. ++j;
  13. }
  14. }
  15. swap(list[j],list[p]);
  16. return j;
  17.  
  18. }
  19. template <typename T>
  20. void sort(T list[], int s, int e) {
  21. if(s < e) {
  22. int p = Partition(list, s, e);
  23. sort(list, s, p-1);
  24. sort(list, p+1, e);
  25. }
  26. }
  27.  
  28. template<typename T> void swap(T* i, T* j) {
  29. T t = *i; *i = *j; *j = i;
  30. }
  31.  
  32. template <typename T>
  33. void PrintArray(T list[], int arraySize){
  34. for(int i=0;i<arraySize;i++){
  35. cout<<list[i]<<" ";
  36. }
  37. cout<<endl<<endl;
  38. }
  39. template<typename T> void quickSort(T list[], int arraySize) {
  40. sort(list, 0, arraySize-1);
  41. }
  42.  
  43. int main() {
  44. int list[10];
  45. cout<<"Enter 10 integers: ";
  46. for(int i=0;i<10;i++) {
  47. cin>>list[i];
  48. }
  49. quickSort(list, 10);
  50. cout<<"The sorted array is: ";
  51. PrintArray(list, 10);
  52.  
  53. return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement