SORTING / İNTERAKTİF DENEY

Insertion Sort

Places each new element in its correct position in the sorted section on the left. This demonstration uses adjacent swaps; it works well for small and nearly sorted arrays.

Ortalama O(n²)

Deney hazır

STEP 0 / 99

Comparisons00

Swaps00

Writes00

Comparisons Moves Seçilen değer Sorted

Hazır

The array is ready. Start the first step.

Hız

Adımlar arasında gezin

Eleman sayısı

Sıfırlama, aynı diziyi başlangıç durumuna getirir.

KODUN AKIŞI

Şu anda ne oluyor?

01Select the element immediately after the sorted section
02Compare the selected element with its left neighbour
03If it is smaller, move it left and keep comparing
04Stop at the correct position and select the next element

MALİYET ANALİZİ

Algorithm properties

Best case: O(n)
Ortalama: O(n²)
Worst case: O(n²)
Extra space: O(1)
Kararlı sıralama: Evet

This version moves the selected element to the left using adjacent swaps. A sorted array requires only n − 1 comparisons. Karmaşıklıklar algoritmaya aittir; görselleştirme geçmişi ek bellek kullanır.