Can you name the main data sorting algorithms?

Main data sorting algorithms that are frequently used and studied:

• Bubble Sort — a simple but inefficient algorithm that compares neighboring elements and swaps them.
• Selection Sort — finds the minimum element and places it at the beginning of the array.
• Insertion Sort — builds a sorted sequence by inserting elements into the correct position.
• Merge Sort — recursively divides the array into parts, sorts them, and merges.
• Quick Sort — selects a pivot element, divides the array, and recursively sorts the parts.
• Heap Sort — builds a heap data structure and extracts elements in order.

In iOS development, built-in Swift methods are often used for sorting, for example:

let array = [5, 3, 8, 1]
let sortedArray = array.sorted() // uses an efficient sorting algorithm

However, understanding the main algorithms is important for optimization and solving non-standard tasks.