Advertisement
Guest User

Untitled

a guest
May 24th, 2018
69
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.62 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. void swap(int &a, int &b) {
  5.     int temp = a;
  6.     a = b;
  7.     b = temp;
  8. }
  9.  
  10. void SelectionSort(int arr[], int n) {
  11.     int current = 0;
  12.     while (current < n - 1) {
  13.         int smallest = current;
  14.         int walker = current + 1;
  15.         while (walker < n) {
  16.             if (arr[walker] < arr[smallest])
  17.                 smallest = walker;
  18.             walker++;
  19.         }
  20.         swap(arr[current], arr[smallest]);
  21.         current++;
  22.     }
  23. }
  24.  
  25. int main(){
  26.     const int n = 6;
  27.     int arr[n] = { 23,78,45,8,32,56 };
  28.     SelectionSort(arr, n);
  29.  
  30.     for (int i = 0; i < n; i++) {
  31.         cout << arr[i] << " ";
  32.     }
  33.     cout << endl;
  34.  
  35.     system("pause");
  36.     return 0;
  37. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement