Thanks bro i dont know about your channel but google bard recommended your channel Complete Python DSA Video podunga bro youtube la full ah tamil video illai
guys who don't understand the above code use this arr = [7,1,4,5,3,2] for i in range(1, len(arr)): curr = arr[i] for j in range(i, 0, -1): if arr[j - 1] > curr: arr[j] = arr[j - 1] else: arr[j] = curr break else: arr[0] = curr print(arr)
Bro Nenga romba clear ah soli kudukuringa It's be perfect Thank you And I messaged u in Instagram regarding some doubts Please consider that And the telegram link is not applicable Please recheck
we can also do like this la !!! #insertion sort x=[7,1,5,3,0,4,2,6,-1] for i in range(1,len(x)): for j in range(i-1,-1,-1): if x[j]>x[i]: x[i],x[j]=x[j],x[i] i-=1 print(x)
nalla detail ah ithe maari video podunga, romba nandri I was searching for a tamil channel like this you know..
Thanks bro ✨️
Super bro super irukku vodeo I liked it very much keep on this work and soon you will the first miles stone that is 100k subs son all the best bro
Thalaivaree Rombaa Nandrii Thalaivareyyyyyy , Lub U Vro
Thanks bro i dont know about your channel but google bard recommended your channel
Complete Python DSA Video podunga bro youtube la full ah tamil video illai
guys who don't understand the above code use this
arr = [7,1,4,5,3,2]
for i in range(1, len(arr)):
curr = arr[i]
for j in range(i, 0, -1):
if arr[j - 1] > curr:
arr[j] = arr[j - 1]
else:
arr[j] = curr
break
else:
arr[0] = curr
print(arr)
Error:
Why are you using 2 else in this code
Can u explain please
Hey super nanba :)
def insertion_sort(arr):
for i in range (1 , len(arr)):
while arr[i-1] > arr[i] and i >0 :
arr[i-1] , arr[i] = arr[i] , arr[i-1]
i = i -1
return arr
Hi ...thanks for the content.i have been searching data structures with python but not satisfied. neenga clear ah explain pannuringa thanks
Thank you
Thanks boss
Comments laam paatha enaku mattum thaan purila pola🙃.....konjam slow ah sollunga bro
I'm here to
😅😂
Bro
Nenga romba clear ah soli kudukuringa
It's be perfect
Thank you
And I messaged u in Instagram regarding some doubts
Please consider that
And the telegram link is not applicable
Please recheck
Sure check pandren. Thank you so much
Queue concept cover pannuga bro
Sure bro next athan
Bro entha company bro neega
Bro quick sort merge sort podunga
Hi, sorry laptop service ku kuduthiruken 10 days aahum, athuku apram videos continuous ah podren,, Really Sorry
Thala va thala va thala
😂🤩❤️
we can also do like this la !!!
#insertion sort
x=[7,1,5,3,0,4,2,6,-1]
for i in range(1,len(x)):
for j in range(i-1,-1,-1):
if x[j]>x[i]:
x[i],x[j]=x[j],x[i]
i-=1
print(x)
I think this is bubble sort