Advertisement
uniteinpain

sorts

Dec 17th, 2017
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.88 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. void swapp(int arr[], int i, int min)
  5. {
  6. int t = arr[min];
  7. arr[min] = arr[i];
  8. arr[i] = t;
  9. }
  10.  
  11. void fasterSelectionSort(int arr[],const int MAX)
  12. {
  13. for (int i = 0; i < MAX - 1; i++)
  14. {
  15. int min = i;
  16. for (int j = i + 1; j < MAX; j++)
  17. {
  18. if (arr[j] < arr[min])
  19. {
  20. min = j;
  21. }
  22. if (j == MAX - 1)
  23. {
  24. swapp(arr, i, min);
  25. }
  26. }
  27. }
  28. }
  29.  
  30. void fillarr(int arr[], const int MAX)
  31. {
  32. for (int i = 0; i < MAX; i++)
  33. {
  34. arr[i] = MAX - i;
  35. }
  36. }
  37.  
  38. void printarr(int arr[],const int MAX)
  39. {
  40. for (int i = 0; i < MAX; i++)
  41. {
  42. cout << arr[i] << " ";
  43. }
  44. }
  45.  
  46. int main()
  47. {
  48. const int MAX = 50000;
  49.  
  50. int arr[MAX];
  51.  
  52. fillarr(arr, MAX);
  53.  
  54. cout << "The unsorted arr is \n";
  55.  
  56. printarr(arr, MAX);
  57.  
  58. fasterSelectionSort(arr, MAX);
  59.  
  60. cout << " \n\nThe sorted arr is \n";
  61.  
  62. printarr(arr, MAX);
  63.  
  64. return 0;
  65. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement