The text below is selected, press Ctrl+C to copy to your clipboard. (⌘+C on Mac) No line numbers will be copied.
Guest
Selection sort
By Guest on 17th January 2024 02:13:34 PM | Syntax: TEXT | Views: 78


New Paste New paste | Download Paste Download | Toggle Line Numbers Show/Hide line no. | Copy Paste Copy text to clipboard
  1. #include <iostream>
  2. using namespace std;
  3. void swap(int &a, int &b) {
  4.     int temp = a;
  5.     a = b;
  6.     b = temp;
  7. }
  8.  
  9. void selectionSort(int arr[], int n) {
  10.     for (int i = 0; i < n - 1; ++i) {
  11.         int minIndex = i;
  12.         for (int j = i + 1; j < n; ++j) {
  13.             if (arr[j] < arr[minIndex]) {
  14.                 minIndex = j;
  15.             }
  16.         }
  17.         swap(arr[i], arr[minIndex]);
  18.     }
  19. }
  20.  
  21. void printArray(int arr[], int size) {
  22.     for (int i = 0; i < size; i++) {
  23.         std::cout << arr[i] << " ";
  24.     }
  25.     std::cout << std::endl;
  26. }
  27.  
  28. int main() {
  29.     int arr[] = {64, 25, 12, 22, 11};
  30.     int n = sizeof(arr) / sizeof(arr[0]);
  31.  
  32.     std::cout << "Original array: ";
  33.     printArray(arr, n);
  34.  
  35.     selectionSort(arr, n);
  36.  
  37.     std::cout << "Sorted array: ";
  38.     printArray(arr, n);
  39.  
  40.     return 0;
  41. }





selection sort