How are the main algorithms for sorting data implemented and functioning?

The main data sorting algorithms include:

• Bubble Sort: compares neighboring elements and swaps them if they are in the wrong order. Repeats until the array is sorted.

• Insertion Sort: builds a sorted sequence by inserting each new element into the correct position.

• Selection Sort: at each step, selects the minimum element from the unsorted part and swaps it with the first element of that part.

• Quick Sort: chooses a pivot element, divides the array into parts with elements less than and greater than the pivot, and recursively sorts these parts.

• Merge Sort: recursively divides the array into halves, sorts them, and merges back into a sorted array.

Example of quick sort in Python:

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)

print(quick_sort([3,6,8,10,1,2,1]))

Each algorithm has its advantages and disadvantages in terms of speed and memory consumption.