Selection Sort in Python, Java and TypeScript

def selection_sort(items: list[int]) -> tuple[int, int]:
    comparisons = swaps = 0
    n = len(items)
    for i in range(n - 1):
        smallest = i
        for j in range(i + 1, n):
            comparisons += 1
            if items[j] < items[smallest]:
                smallest = j
        if smallest != i:
            items[i], items[smallest] = items[smallest], items[i]
            swaps += 1
    return comparisons, swaps


for numbers in ([1, 2, 3, 4, 5, 6, 7], [7, 6, 5, 4, 3, 2, 1]):
    before = " ".join(map(str, numbers))
    comparisons, swaps = selection_sort(numbers)
    after = " ".join(map(str, numbers))
    print(f"{before} -> {after}: {comparisons} comparisons, {swaps} swaps")

import java.util.Arrays;
import java.util.stream.Collectors;

public class SelectionSortCode {
    record Counts(int comparisons, int swaps) {}

    static Counts selectionSort(int[] items) {
        int comparisons = 0;
        int swaps = 0;
        int n = items.length;
        for (int i = 0; i < n - 1; i++) {
            int smallest = i;
            for (int j = i + 1; j < n; j++) {
                comparisons++;
                if (items[j] < items[smallest]) {
                    smallest = j;
                }
            }
            if (smallest != i) {
                int held = items[i];
                items[i] = items[smallest];
                items[smallest] = held;
                swaps++;
            }
        }
        return new Counts(comparisons, swaps);
    }

    static String joined(int[] items) {
        return Arrays.stream(items).mapToObj(String::valueOf).collect(Collectors.joining(" "));
    }

    public static void main(String[] args) {
        int[][] inputs = {{1, 2, 3, 4, 5, 6, 7}, {7, 6, 5, 4, 3, 2, 1}};
        for (int[] numbers : inputs) {
            String before = joined(numbers);
            Counts counts = selectionSort(numbers);
            System.out.println(before + " -> " + joined(numbers) + ": "
                    + counts.comparisons() + " comparisons, " + counts.swaps() + " swaps");
        }
    }
}

interface Counts {
  comparisons: number;
  swaps: number;
}

function selectionSort(items: number[]): Counts {
  let comparisons = 0;
  let swaps = 0;
  const n = items.length;
  for (let i = 0; i < n - 1; i++) {
    let smallest = i;
    for (let j = i + 1; j < n; j++) {
      comparisons++;
      if (items[j] < items[smallest]) {
        smallest = j;
      }
    }
    if (smallest !== i) {
      [items[i], items[smallest]] = [items[smallest], items[i]];
      swaps++;
    }
  }
  return { comparisons, swaps };
}

const inputs: number[][] = [[1, 2, 3, 4, 5, 6, 7], [7, 6, 5, 4, 3, 2, 1]];
for (const numbers of inputs) {
  const before = numbers.join(" ");
  const { comparisons, swaps } = selectionSort(numbers);
  console.log(`${before} -> ${numbers.join(" ")}: ${comparisons} comparisons, ${swaps} swaps`);
}