sisestusmeetod

Sisestusmeetod, known in English as the insertion method, is a simple sorting algorithm. It works by dividing the input list into two parts: a sorted sublist and an unsorted sublist. Initially, the sorted sublist contains only the first element, and the rest of the list is unsorted. The algorithm then iteratively takes elements from the unsorted sublist and inserts them into their correct position within the sorted sublist. This process continues until all elements from the original list have been moved to the sorted sublist, resulting in a fully sorted list.

To insert an element, the algorithm compares it with the elements in the sorted sublist, starting from the rightmost element. If the current element from the unsorted sublist is smaller than an element in the sorted sublist, that element in the sorted sublist is shifted one position to the right to make space. This comparison and shifting continues until the correct position for the element is found, or the beginning of the sorted sublist is reached. The element is then placed into this newly opened slot. The sisestusmeetod is known for its simplicity and efficiency on small datasets or nearly sorted lists. Its time complexity is O(n^2) in the worst and average cases, making it less suitable for large, unsorted datasets compared to more advanced algorithms like quicksort or mergesort.