Exchange Sort

function exchangeSort(arr) {
  for (let i = 0; i < arr.length - 1; i++)
    for (let j = i + 1; j < arr.length; j++)
      if (arr[i] > arr[j])
        [arr[i], arr[j]] = [arr[j], arr[i]];
}

def exchange_sort(arr):
    for i in range(len(arr) - 1):
        for j in range(i + 1, len(arr)):
            if arr[i] > arr[j]:
                arr[i], arr[j] = arr[j], arr[i]

void exchangeSort(vector<int>& arr) {
  for (int i = 0; i < (int)arr.size()-1; i++)
    for (int j = i+1; j < (int)arr.size(); j++)
      if (arr[i] > arr[j])
        swap(arr[i], arr[j]);
}

void ExchangeSort(int[] arr) {
  for (int i = 0; i < arr.Length - 1; i++)
    for (int j = i + 1; j < arr.Length; j++)
      if (arr[i] > arr[j])
        (arr[i], arr[j]) = (arr[j], arr[i]);
}

void exchangeSort(int arr[], int n) {
  for (int i = 0; i < n - 1; i++)
    for (int j = i + 1; j < n; j++)
      if (arr[i] > arr[j]) {
        int t = arr[i]; arr[i] = arr[j]; arr[j] = t;
      }
}