сортировка

#pragma once
#include <iostream>

using namespace std;

void my_swap(int& a, int& b) {
    //cout << "IN FUN: " << a << b << endl;
    int tmp = b;
    b = a;
    a = tmp;
    //cout << "IN FUN: " << a << b << endl;
}

void show_arr(int size, int arr[]) {
    for (int k = 0; k < size; k++)
        cout << arr[k] << " ";
    cout << endl;
}

int find(int size, int arr[], int ell) {
    for (int k = 0; k < size; k++) {
        if (arr[k] == ell)
            return k;
    }
    return -1;
}

void discrete_sort(int size, int arr[]) {
    // элементы массива могут быть { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
    int frequency[10]{};

    for (int k = 0; k < size; k++) {
        frequency[arr[k]]++;
    }

    int m = 0;
    for (int k = 0; k < 10; k++) {
        for (int n = 0; n < frequency[k]; n++) {
            arr[m] = k;
            m++;
        }
    }
    show_arr(10, frequency);
}

void bubble_sort(int size, int arr[]) {

}

void select_sort(int size, int arr[]) {
    int min_id;
    for (int n = 0; n < size - 1; n++) {
        min_id = n;
        for (int k = n + 1; k < size; k++) {
            if (arr[k] < arr[min_id]) {
                min_id = k;
            }
        }
        my_swap(arr[n], arr[min_id]);
    }

}

void insert_sort(int size, int arr[]) {

}