Repeatedly swaps adjacent elements that are out of order. Simple to understand, slow in practice.
Launch →Finds the minimum unsorted element and moves it into place, one pass at a time.
Launch →Builds a sorted region left to right, inserting each new element into its correct position.
Launch →Divides the array in half recursively, then merges sorted halves back together. Guaranteed O(n log n).
Launch →Picks a pivot, partitions elements around it, then recurses. Fast in practice; O(n²) worst case.
Launch →Shuffles the array randomly and checks if it's sorted. Repeats until it gets lucky. Not recommended.
Launch →Checks repeatedly if the array has spontaneously sorted itself. Relies entirely on cosmic intervention.
Launch →Checks each element one by one from left to right. Works on any array — sorted or not.
Launch →Halves the search space each step by comparing against the midpoint. Requires a sorted array.
Launch →Picks a random index and checks if it's the target. Repeats until it accidentally succeeds.
Launch →