def insertionSort(array): for step in range(1, len(array)): key = array[step] j = step - 1
# Compare key with each element on the left of it until an element smaller than it is found # For descending order, change keyarray[j]. while j >= 0 and key < array[j]: array[j + 1] = array[j] j = j - 1
# Place key at after the element just smaller than it. array[j + 1] = key
Amazingly clear and concise video! Thank you, this helped a lot in my DSA class.
Que animación tan buena!
This animation is really good! did you created this using Manim?
Very helpful!
def insertionSort(array):
for step in range(1, len(array)):
key = array[step]
j = step - 1
# Compare key with each element on the left of it until an element smaller than it is found
# For descending order, change keyarray[j].
while j >= 0 and key < array[j]:
array[j + 1] = array[j]
j = j - 1
# Place key at after the element just smaller than it.
array[j + 1] = key
thank you so much
So satisfying 👍
is this ASMR
for an array A, of size N and containing N elements:
for int i from 1 to N-1
int j = i
while j > 0 && a[j] < a[j-1]
swap(a[j], a[j-1])
j--