Thuật toán sắp xếp (Sorting)

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        swapped = False
        for j in range(n - 1 - i):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
                swapped = True
        if not swapped:
            break
    return arr

fun bubbleSort(arr: MutableList<Int>): List<Int> {
    val n = arr.size
    for (i in 0 until n) {
        var swapped = false
        for (j in 0 until n - 1 - i) {
            if (arr[j] > arr[j + 1]) {
                val temp = arr[j]
                arr[j] = arr[j + 1]
                arr[j + 1] = temp
                swapped = true
            }
        }
        if (!swapped) break
    }
    return arr
}

List<int> bubbleSort(List<int> arr) {
  int n = arr.length;
  for (int i = 0; i < n; i++) {
    bool swapped = false;
    for (int j = 0; j < n - 1 - i; j++) {
      if (arr[j] > arr[j + 1]) {
        int temp = arr[j];
        arr[j] = arr[j + 1];
        arr[j + 1] = temp;
        swapped = true;
      }
    }
    if (!swapped) break;
  }
  return arr;
}

func bubbleSort(_ arr: inout [Int]) {
    let n = arr.count
    for i in 0..<n {
        var swapped = false
        for j in 0..<(n - 1 - i) {
            if arr[j] > arr[j + 1] {
                arr.swapAt(j, j + 1)
                swapped = true
            }
        }
        if !swapped { break }
    }
}

void bubbleSort(int[] arr) {
    int n = arr.length;
    for (int i = 0; i < n; i++) {
        boolean swapped = false;
        for (int j = 0; j < n - 1 - i; j++) {
            if (arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
                swapped = true;
            }
        }
        if (!swapped) break;
    }
}

def merge_sort(arr):
    if len(arr) <= 1:
        return arr
    
    mid = len(arr) // 2
    left = merge_sort(arr[:mid])
    right = merge_sort(arr[mid:])
    
    return merge(left, right)
 
def merge(left, right):
    result = []
    i = j = 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1
    result.extend(left[i:])
    result.extend(right[j:])
    return result

fun mergeSort(arr: List<Int>): List<Int> {
    if (arr.size <= 1) return arr
    
    val mid = arr.size / 2
    val left = mergeSort(arr.subList(0, mid))
    val right = mergeSort(arr.subList(mid, arr.size))
    
    return merge(left, right)
}
 
fun merge(left: List<Int>, right: List<Int>): List<Int> {
    val result = mutableListOf<Int>()
    var i = 0; var j = 0
    while (i < left.size && j < right.size) {
        if (left[i] <= right[j]) result.add(left[i++])
        else result.add(right[j++])
    }
    result.addAll(left.subList(i, left.size))
    result.addAll(right.subList(j, right.size))
    return result
}

List<int> mergeSort(List<int> arr) {
  if (arr.length <= 1) return arr;
  
  int mid = arr.length ~/ 2;
  List<int> left = mergeSort(arr.sublist(0, mid));
  List<int> right = mergeSort(arr.sublist(mid));
  
  return merge(left, right);
}
 
List<int> merge(List<int> left, List<int> right) {
  List<int> result = [];
  int i = 0, j = 0;
  while (i < left.length && j < right.length) {
    if (left[i] <= right[j]) result.add(left[i++]);
    else result.add(right[j++]);
  }
  result.addAll(left.sublist(i));
  result.addAll(right.sublist(j));
  return result;
}

func mergeSort(_ arr: [Int]) -> [Int] {
    if arr.count <= 1 { return arr }
    
    let mid = arr.count / 2
    let left = mergeSort(Array(arr[0..<mid]))
    let right = mergeSort(Array(arr[mid...]))
    
    return merge(left, right)
}
 
func merge(_ left: [Int], _ right: [Int]) -> [Int] {
    var result = [Int]()
    var i = 0, j = 0
    while i < left.count && j < right.count {
        if left[i] <= right[j] { result.append(left[i]); i += 1 }
        else { result.append(right[j]); j += 1 }
    }
    return result + left[i...] + right[j...]
}

int[] mergeSort(int[] arr) {
    if (arr.length <= 1) return arr;
    
    int mid = arr.length / 2;
    int[] left = mergeSort(Arrays.copyOfRange(arr, 0, mid));
    int[] right = mergeSort(Arrays.copyOfRange(arr, mid, arr.length));
    
    return merge(left, right);
}
 
int[] merge(int[] left, int[] right) {
    int[] result = new int[left.length + right.length];
    int i = 0, j = 0, k = 0;
    while (i < left.length && j < right.length) {
        if (left[i] <= right[j]) result[k++] = left[i++];
        else result[k++] = right[j++];
    }
    while (i < left.length) result[k++] = left[i++];
    while (j < right.length) result[k++] = right[j++];
    return result;
}

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    middle = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    
    return quick_sort(left) + middle + quick_sort(right)

fun quickSort(arr: List<Int>): List<Int> {
    if (arr.size <= 1) return arr
    
    val pivot = arr[arr.size / 2]
    val left = arr.filter { it < pivot }
    val middle = arr.filter { it == pivot }
    val right = arr.filter { it > pivot }
    
    return quickSort(left) + middle + quickSort(right)
}

List<int> quickSort(List<int> arr) {
  if (arr.length <= 1) return arr;
  
  int pivot = arr[arr.length ~/ 2];
  List<int> left = arr.where((x) => x < pivot).toList();
  List<int> middle = arr.where((x) => x == pivot).toList();
  List<int> right = arr.where((x) => x > pivot).toList();
  
  return [...quickSort(left), ...middle, ...quickSort(right)];
}

func quickSort(_ arr: [Int]) -> [Int] {
    if arr.count <= 1 { return arr }
    
    let pivot = arr[arr.count / 2]
    let left = arr.filter { $0 < pivot }
    let middle = arr.filter { $0 == pivot }
    let right = arr.filter { $0 > pivot }
    
    return quickSort(left) + middle + quickSort(right)
}

List<Integer> quickSort(List<Integer> arr) {
    if (arr.size() <= 1) return arr;
    
    int pivot = arr.get(arr.size() / 2);
    List<Integer> left = arr.stream().filter(x -> x < pivot).toList();
    List<Integer> middle = arr.stream().filter(x -> x == pivot).toList();
    List<Integer> right = arr.stream().filter(x -> x > pivot).toList();
    
    List<Integer> result = new ArrayList<>(quickSort(left));
    result.addAll(middle);
    result.addAll(quickSort(right));
    return result;
}