I'm trying my luck to be a good programmer in Python by watching this Playlist.See me in 7 years or so
@navneetbharadwaj21694 жыл бұрын
please add more lectures on python programming as the content quality was amazing
@kamaboko14 жыл бұрын
Sure, there may be a shorter (i.e., more dry way ) to do this, but the explanation is clear. Thanks.
@ayushmishra-on2cs8 жыл бұрын
plz upload some more vidoes of python...... i want to learn everything from a to z in python..and u teach awesome!
@siddharthmalik72445 жыл бұрын
Thanks bro you nailed it.
@jasmeetsingh54253 жыл бұрын
Back in the day when even python required 2 lines for swapping variables. :P
@Gtajora13 жыл бұрын
I love you Sal. I truly do.
@rck109d13 жыл бұрын
@mauroprovatos the part of the list to the left of index never decreases left-to-right when beginning the outer for loop (because the list is sorted from left to right). You can think of the inner while loop as marching what was originally list[index] to the left as far as it needs. For each step of that loop the same value is getting assigned from right to left. So list[i+1] == value (equals) will be true. If the left list part weren't already sorted then the algorithm wouldn't be correct.
@BYZ100012 жыл бұрын
please please please give more lectures on algorithms :)
@vijy99803 жыл бұрын
You are the best.
@yusufdemir93458 жыл бұрын
def insertionSort(alist):
@hafzasaleem65243 жыл бұрын
nice sharing
@TheTenaciousE13 жыл бұрын
Wow I just noticed this Computer Science playlist, I'm going to be studying this in university next year, so this will be some nice preparation! Thanks a lot! =)
@mauroprovatos13 жыл бұрын
by list[i+1] = list [i wont the initial value of list[i+1] be lost forevah?
@mohammadkhalili12892 жыл бұрын
Very useful
@hkdobrev12 жыл бұрын
The if statement in the loop is obsolete. It could and should be included in the while condition. This way the break statement would be avoided.
@Giorgio2794 жыл бұрын
Is this available with strings instead of numbers?