I fell in love with your tutorials, thank you very much for your work! you also have an amazing voice, which makes watching videos especially enjoyable. Love, Jam
There is an implementation of insertion sort that is almost twice as fast: def insertion(list):
for i in range(1,len(list)): temp = list[i] index = i - 1
while index >= 0 and list[index] > temp: list[index + 1] = list[index] index -= 1 list[index + 1] = temp return list This is because Derricks implementation needs almost twice as many steps for each iteration of the while-loop compared to the implementation proposed here (two assignment statements: list_a[i] to list_a[i-1] and vice versa). You can confirm this for yourself comparing the running times of both implementations: you will see that the second implementation is almost twice as fast.
Hey guys, optimized version of the code: def insertion_sort(list_to_be_sorted): for i in range(1, len(list_to_be_sorted)): key = list_to_be_sorted[i] j = i - 1 while j >= 0 and key < list_to_be_sorted[j]: list_to_be_sorted[j + 1] = list_to_be_sorted[j] j -= 1 list_to_be_sorted[j + 1] = key return list_to_be_sorted
As much as your explanations are great, your editing makes these videos a cut above the rest! That green screen (?) at the beginning is just *chef's kiss*
I dont really understand what " i = i - 1" stands for. Coz the only thing i can actually see, is we subtract 1 from "i" each time, which makes us to stay at the same exact number everytime. Can someone please this like you would do it for a child? Thank you
In the top level loop, we are moving left to right, where we are accepting one new element from unsorted part of list to sorted and on second level loop, we are comparing between the numbers in the sorted part of the list that why we use i = i -1
This is the best video, I finally understood it. You made it very easy, I'll subscribe. I recreated it, hope it looks good: list = []#list limit = int(input("Amount of elements to sort? "))#only int for _ in range(limit):#repetition item = input("Type the element: ") #int or str list.append(item)#addition to the list for i in range(1,len(list)):#looping through list value_to_sort = list[i]#element to the right. while list[i-1] > value_to_sort and i > 0: #compare left to right elements list[i-1], list[i] = list[i], list[i-1] #Ascending # list[i-1], list[i] = list[i], list[i-1] #Descending i -=1 print("List: ", list) #output
Hey , this helped me a lot , but I still couldn't figure out one thing , why you wrote i = i -1. I didn't understand this line of code, could you help me out?
Because that while loop works like this : if value at index i is smaller than value at i-1 it switches places. Then we need to check if our original value at i (actual i-1) is maybe smaller than value at i-2. And so it goes until our original value is greater than value at index i on the left. Then if our value is greater than the one with index-1 we exit while loop and get to the next value. Sorry if i mispelled something wrong, i understood this code today :p
People who produce coding tutorials can learn a lot of excellent things from how you do yours. Thanks for the great videos! I think this series is great. Some requests for your next videos in this series (more for keeping a nice set of algos for your viewers rather than my own needs) .. but I think it would be nice to add maybe some of these: Linked List, Tree Traversal (maybe in the context of walking a directory structure. in other words, DAGs, Directed-Acyclic Graphs), maybe also parsing of tag pairs like matching parentheses or brackets or similar, since this basically is a common and juicy little application of stacks, pushing/popping arrays etc. My suggestions are coming from algorithms I was tested on during assessments at Apple, Google and Yahoo for senior roles, but also those are elegant ones I like and can be either simple or very challenging so there is a lot to work with in those. Again, thanks a lot for the excellent videos. The content, presentation and topics are excellent and also, I really love the visuals, colors and fonts etc. No time wasted on irrelevant content. You've removed all the barriers to learning the quality content in an enjoyable, fast way and that is what it is all about. One final thought. For getting a job, people must master as many of the popular algorithms as they can. The best jobs always hinge on this, regardless of experience level. (I'm not saying that's how it should be but that is the reality of algorithms and software engineering jobs.)
Not going to code it but you can use binary search to find the position for "value_to_sort" into the sorted array. That way the algorithm performs at O(n+log(N)), of course, you also need to leave gaps between the sorted elements to prevent new insertions to trigger array shifting.
Thank you bro for these python algorithm, great explained, please bro if you might do more videos of this topic 'Python Algorithm Series for Beginners', I'll apreciate it a lot.
Hey! Thankyou so much for the wonderful tutorial. I got the concept but I'm having a small doubt that If we are going ahead in the list shouldn't it be i = i + 1 as we are going to the next element?
for loop will take care of traversing through the list. i=i-1 is to compare the element from the unsorted list to sorted list one by one(it will move in left direction)
@@sambhavbhalla2697 essentially the while loop is a makeshift nested for loop. So for every iteration of the outer loop (the for loop) we are moving forward in the sequence and and we want to find the right slot for the current item therefore in the while loop we are going backwards or leftward so that we can check the current element against all elements that have already been sorted and find the correct spot. It seems to be rather inefficient tho, given its time complexity is O(n^2) worst case because you appear to have the identity 1+2+3+... n
def insertionSort(array): index = 0 for item in range(index , len(array) ): first_ptr = index second_ptr = index - 1 while second_ptr > -1: if array[first_ptr] < array[second_ptr]:
I have a quick question, it may seem stupid to ask but I cannot see it. I don't understand why the i = i - 1 is necessary? I thought the incrementing step through the list was the job of the for i in range() operation? I am a complete noob to all this stuff. Thank you for your great content, it's really helping me grasp applications of the foundations I've been building.
Range function only generates a sequence of values. for loop makes sure that operation in body of for loop is carried out on all the values generated by range function. it doesn't do anything related to increment until specified in body of for loop
Wrote this before looking at your solution :) list_nos = [10,16,8,12,15,6,3,9,5,100] def insertion_sort(list_nos): list_new=[] for i in range(len(list_nos)): list_new.append(list_nos[i]) while i>0: if list_new[i]
it runs fine without declaring list_a as an additional variable. is this bad practice? def insertion_list(list_a): # indexing_len = range(1, len(list_a)) "program runs just fine without declaring this variable. can anyone please explain if it's bad practice? for i in range(1, len(list_a)): value_sort = list_a[i] while list_a[i - 1] > value_sort and i > 0: list_a[i], list_a[i - 1] = list_a[i - 1], list_a[i] i = i -1 return list_a
As far as I understand you check with i = i-1 the same element again against the next possible element on its left side until the while condition is False.
4:34 This code is not bad but I think there's no reason to create new variables here. Just have a look at my code below: def ins_sort(arr:list) -> list: for i in range(1, len(arr)): for j in range(0, len(arr[:i])): if arr[i] < arr[j]: arr[i], arr[j] = arr[j], arr[i] return arr I use slicing of a list instead of creating new variables
Hey Derik, my name is Henrique, found you on youtube and have been watching your videos a lot, and I am loving it, you are doing a great job! Found your videos when researching how to automate some basic stuff of my daily activities I own a small distribution business where I sell construction items to small traders and I have a problem I would like to solve. with around 200 customers listed on my spreadsheet I sell to around 5 of day everyday, I could be selling much more as my customers need products to do their job, however is very hard to predict when they need (hard to remember last time they bought and if they are running out of material) I got 2 problems that I am sure could be easily sorted with 2 spreadsheets and some Python Problem 1, when I m out for a delivery I usually know there are some of my customers around that might want to buy my products, however as I am driving is just impossible to stop my car and try to call one by one to figure out who needs my products. On my spreadsheet I could sort the list of potential customer using the first 3 characters of their POSTCODE as it would tell me how close they are, I could pick the 3 customers below and 3 customers after the postcode I am delivering. customer_name Cust_whatsapp Customer_Postcode Jan_purc Feb_Pur John +551196194988 03650000 Paint Glue Mary +5511999054333 03750000 Paint none Paul +5511999999999 03760000 Glue none Question 1 - what can I do in Python to go to my sheet and select a group of customer's postcode by proximity of address I am delivering ( It would be also nice if they could be automatically sent to web.whatsapp so I could send them a message. Problem 2 On a second spreadsheet I have the purchase history, I woul love to be able to predict when my Customer is ready to buy again. Question 2- Is it possible to create a simple code to read all purchase history from columns and give me a hint of when they are more likely to buy again? some output in a third spreadsheet with a list ordered by most likely to need, this way I dont need to do it by chance and keep skipping customers to my competitors Hey Man, even if I don't get a reply, I still love what you do, sharing knowledge is the best thing a person can do! Sooner or later I will figure out how to do it. Cheers Henrique
I would suggest you hire a coder for your needs. Because as far as I see your business is selling items and not coding. In python maybe Pandas and some grafic plot modules like matplotlib can help. Not sure about your live location tracking and clients nearby though. Good luck
Shorter code(Not faster though): def insertion_sort(lst): for i in range(1, len(lst)): while i > 0 and lst[i] < lst[i-1]: lst[i], lst[i - 1] = lst[i - 1], lst[i] i -= 1 return lst
@@atod2572 we are using i=i-1 coz we are not just using the left element, I'd the left element is not larger it will check the left of left till zeroth index Hope you got it now. Don't check for just i=1 Check for say i=4 or 5 Then you will get it. Website: visualgo.com And check for insert sort
@@amanahmed6057 Let him teach the way he does without music, most of us here are not to spend some good time listening to music but to learn concepts that are skipped or explained casually by professors at our universities.
![PURPEECH - นี่ฉันเองคนที่... (It's me) [Official MV]](http://i.ytimg.com/vi/NuhHd0hOOg8/mqdefault.jpg)
Oh god, you explain this way better than my Software teacher. Thank you so much!
Thank you so much for your video! I was having a hard time understanding the insertion sort algorithm and now I have a much better handle on it.
I fell in love with your tutorials, thank you very much for your work! you also have an amazing voice, which makes watching videos especially enjoyable. Love, Jam
This is the first sorting algorithm I've attempted to learn, this video has been a tremendous help. Thank you
th-cam.com/video/lzS_DiMlR2Q/w-d-xo.html
Thanks for the video! Another golden nugget :)
having an explanation that only takes a minute is the best. keep it up!!
Can you please explain why i=i-1 make the next iteration??
That is moving towards left side in sorted list to check where should we insert the current unsorted element.
There is an implementation of insertion sort that is almost twice as fast:
def insertion(list):
for i in range(1,len(list)):
temp = list[i]
index = i - 1
while index >= 0 and list[index] > temp:
list[index + 1] = list[index]
index -= 1
list[index + 1] = temp
return list
This is because Derricks implementation needs almost twice as many steps for each iteration of the while-loop compared to the implementation proposed here (two assignment statements: list_a[i] to list_a[i-1] and vice versa). You can confirm this for yourself comparing the running times of both implementations: you will see that the second implementation is almost twice as fast.
This is pretty clever. Thanks!
You explained this so well! Even a 10 year old would understand!
Hey guys, optimized version of the code:
def insertion_sort(list_to_be_sorted):
for i in range(1, len(list_to_be_sorted)):
key = list_to_be_sorted[i]
j = i - 1
while j >= 0 and key < list_to_be_sorted[j]:
list_to_be_sorted[j + 1] = list_to_be_sorted[j]
j -= 1
list_to_be_sorted[j + 1] = key
return list_to_be_sorted
This code really is good. Thanks a lot !
i love your voice, it's so calm, clear and comfortable
So nice explanation .. I was finding insertion sort very tough , but your interpretation made me easy to understand .. Thanks a lot Derrick..
As much as your explanations are great, your editing makes these videos a cut above the rest! That green screen (?) at the beginning is just *chef's kiss*
Can't believe i understood all of it in less than 6 minutes THANK YOU
Thank you mate. These are great!
I can always rely on your videos to give a good explanation! Thanks!!!
I dont really understand what " i = i - 1" stands for. Coz the only thing i can actually see, is we subtract 1 from "i" each time, which makes us to stay at the same exact number everytime. Can someone please this like you would do it for a child? Thank you
same doubt
@Maks Have exactly the same question. unfortunately you didnt get an answer
In the top level loop, we are moving left to right, where we are accepting one new element from unsorted part of list to sorted and on second level loop, we are comparing between the numbers in the sorted part of the list that why we use i = i -1
KNOWLEDGEABLE CONTENT KEEP IT UP BROTHER😎 #I AM FROM INDIA
YOU ARE A LEGEND!
Thank you so much
Great Content man
Thank you so much, bro. I see the neatest codes in your videos. Keep making videos on more difficult topics.
It's confirm now, every guy with a dead face and freakin light speed brain is a developer
Yeah...they said learning to code was free but took away my childhood :/
Hi. can we do as simple as:
for i in range(0,len(lst)):
while (lst[i-1]>lst[i] and i>0):
lst[i-1],lst[i]=lst[i],lst[i-1]
i-=1
print(lst)
Who else watching from india 🇮🇳
Cubby
Dude you are awesome, believe me, and mark my words.
This is the best video, I finally understood it. You made it very easy, I'll subscribe.
I recreated it, hope it looks good:
list = []#list
limit = int(input("Amount of elements to sort? "))#only int
for _ in range(limit):#repetition
item = input("Type the element: ") #int or str
list.append(item)#addition to the list
for i in range(1,len(list)):#looping through list
value_to_sort = list[i]#element to the right.
while list[i-1] > value_to_sort and i > 0: #compare left to right elements
list[i-1], list[i] = list[i], list[i-1] #Ascending
# list[i-1], list[i] = list[i], list[i-1] #Descending
i -=1
print("List: ", list) #output
I just went through 10 videos but this video is just got throw too my head and other's were bounces over 🤣 thanks man
You're awesome dude! Thanks! Keep the videos up
So Good. Keep Going Bro
if i could like this video a million times i would.. thank you soo much
Hey , this helped me a lot , but I still couldn't figure out one thing , why you wrote i = i -1. I didn't understand this line of code, could you help me out?
Thank you so much. The material I was given to teach me this only explained the concept and didn't explain the example code at all.
This has the best time and space complexity
Run this code into Pythontutor to understand
for i in range(1,len(arr)):
current = arr[i]
while i > 0 and arr[i-1] > current:
arr[i] = arr[i-1] # shifting larger number to the right
i= i-1
arr[i] = current
really want to see merge sort & depth-first search by you! such a cool explanation
me too!
Thanks for the video! Very pleasant to watch. You explained everything in detail.
THANK YOU YOU'RE SO GOOD AT EXPLAINING.
quick question: at the end why it is i = i - 1 instead of i = i + 1 ??
i have the same doubt... so if you get the answer pls let me know as well
Because that while loop works like this : if value at index i is smaller than value at i-1 it switches places. Then we need to check if our original value at i (actual i-1) is maybe smaller than value at i-2. And so it goes until our original value is greater than value at index i on the left. Then if our value is greater than the one with index-1 we exit while loop and get to the next value. Sorry if i mispelled something wrong, i understood this code today :p
@@plackowsky4198 you have explained it very well, infact @Derric Sherrill missed it, thanks Bro!
This is sooo nicely explained. Thanks.
this is what i looking for similar to macro SAS and i can test in python, thank you for your guide sensei
Simplest explantion avaliable online, Thanks!
wouldnt this algorithm keep decrementing the value of x even though it is clear no more checking is required in that particular iteration ?
Man, what a jawline!!
thanks a lot Derrick, please keep on doing gr8 stuff.
Great vid, thank you!
That was really helpful. Thanks
Outstanding content, very clear and organized, thank you!
People who produce coding tutorials can learn a lot of excellent things from how you do yours. Thanks for the great videos! I think this series is great. Some requests for your next videos in this series (more for keeping a nice set of algos for your viewers rather than my own needs) .. but I think it would be nice to add maybe some of these: Linked List, Tree Traversal (maybe in the context of walking a directory structure. in other words, DAGs, Directed-Acyclic Graphs), maybe also parsing of tag pairs like matching parentheses or brackets or similar, since this basically is a common and juicy little application of stacks, pushing/popping arrays etc. My suggestions are coming from algorithms I was tested on during assessments at Apple, Google and Yahoo for senior roles, but also those are elegant ones I like and can be either simple or very challenging so there is a lot to work with in those. Again, thanks a lot for the excellent videos. The content, presentation and topics are excellent and also, I really love the visuals, colors and fonts etc. No time wasted on irrelevant content. You've removed all the barriers to learning the quality content in an enjoyable, fast way and that is what it is all about. One final thought. For getting a job, people must master as many of the popular algorithms as they can. The best jobs always hinge on this, regardless of experience level. (I'm not saying that's how it should be but that is the reality of algorithms and software engineering jobs.)
Nice video man, thank you for the clarity
Thanks! was struggling to understand this one, but it was so simple!
Not going to code it but you can use binary search to find the position for "value_to_sort" into the sorted array. That way the algorithm performs at O(n+log(N)), of course, you also need to leave gaps between the sorted elements to prevent new insertions to trigger array shifting.
Thank you bro for these python algorithm, great explained, please bro if you might do more videos of this topic 'Python Algorithm Series for Beginners', I'll apreciate it a lot.
So much better than my professor !
Love your explanation. Please keep making more videos like this
great explanation
I would like to congratulate you on your hands
Hey! Thankyou so much for the wonderful tutorial. I got the concept but I'm having a small doubt that If we are going ahead in the list shouldn't it be i = i + 1 as we are going to the next element?
for loop will take care of traversing through the list. i=i-1 is to compare the element from the unsorted list to sorted list one by one(it will move in left direction)
@@mohameduvais1821 but the for loop moves to the right , so idk this is confusing didnt understand that part
@@sambhavbhalla2697 essentially the while loop is a makeshift nested for loop. So for every iteration of the outer loop (the for loop) we are moving forward in the sequence and and we want to find the right slot for the current item therefore in the while loop we are going backwards or leftward so that we can check the current element against all elements that have already been sorted and find the correct spot. It seems to be rather inefficient tho, given its time complexity is O(n^2) worst case because you appear to have the identity 1+2+3+... n
why do we need to impose i>0? and i=i+1 works?
Great explanation, thanks.
clear explanation, thank you
Great! Can you teach insertion sort program without function?
Without function then you need to directly provide the list instead of the function. millioninformations.com
@@Narendiranath That's an easy way to get your email spammed
@@καλαμ Thanks
@@Narendiranath No worries.
Thanks so much !
great explanation. Thanks!
Does this work for strings too? I want to sort a list alphabeticly
Thankyou Very much
why is it i = i - 1 instead of i = i + 1？Aren't we going to the right to check？
how does line 8 exactly work? I know you said it swaps them but how
Seems like indexing_range should be equal " range(1, len(list_a)+1)". Without "+1" last item won't be reached and hence sorted
Thanks man keep making videos
this is great, but can you do the same with for loop?
def insertionSort(array):
index = 0
for item in range(index , len(array) ):
first_ptr = index
second_ptr = index - 1
while second_ptr > -1:
if array[first_ptr] < array[second_ptr]:
array[second_ptr] , array[first_ptr] = array[first_ptr] , array[second_ptr]
else:
break
second_ptr = second_ptr - 1
first_ptr = first_ptr - 1
index = index + 1
why was i=I-1 written ?
Can you make a RSA algorithm and SDES key generation with Inception and Description please .
Hello good explanation,
thanku so much bro
Thanks a ton!
I confused, We have builtin sort function in python so why we need that too much code.
Thank you very much this helped a lot :))
Thank you
I have a quick question, it may seem stupid to ask but I cannot see it.
I don't understand why the i = i - 1 is necessary?
I thought the incrementing step through the list was the job of the for i in range() operation?
I am a complete noob to all this stuff. Thank you for your great content, it's really helping me grasp applications of the foundations I've been building.
Range function only generates a sequence of values. for loop makes sure that operation in body of for loop is carried out on all the values generated by range function. it doesn't do anything related to increment until specified in body of for loop
Thanks bruh pls do videos on matplotlib and seaborn
Wrote this before looking at your solution :)
list_nos = [10,16,8,12,15,6,3,9,5,100]
def insertion_sort(list_nos):
list_new=[]
for i in range(len(list_nos)):
list_new.append(list_nos[i])
while i>0:
if list_new[i]
why are u swappig it in that way ,i thought it was meant to be the reversed way of yours?
n
Nice one👍
it runs fine without declaring list_a as an additional variable.
is this bad practice?
def insertion_list(list_a):
# indexing_len = range(1, len(list_a))
"program runs just fine without declaring this variable. can anyone please explain if it's bad practice?
for i in range(1, len(list_a)):
value_sort = list_a[i]
while list_a[i - 1] > value_sort and i > 0:
list_a[i], list_a[i - 1] = list_a[i - 1], list_a[i]
i = i -1
return list_a
What if you want the numbers ordered as high to low? How would you do that?
just perform this same code and then reverse the list. voila.
thanks! :)
Great
Can anyone let me know why did we write i=I-1 ??
As far as I understand you check with i = i-1 the same element again against the next possible element on its left side until the while condition is False.
4:34 This code is not bad but I think there's no reason to create new variables here. Just have a look at my code below:
def ins_sort(arr:list) -> list:
for i in range(1, len(arr)):
for j in range(0, len(arr[:i])):
if arr[i] < arr[j]:
arr[i], arr[j] = arr[j], arr[i]
return arr
I use slicing of a list instead of creating new variables
I think this one takes more time
Hey Derik,
my name is Henrique, found you on youtube and have been watching your videos a lot, and I am loving it, you are doing a great job!
Found your videos when researching how to automate some basic stuff of my daily activities I own a small distribution business where I sell construction items to small traders and I have a problem I would like to solve.
with around 200 customers listed on my spreadsheet I sell to around 5 of day everyday, I could be selling much more as my customers need products to do their job, however is very hard to predict when they need (hard to remember last time they bought and if they are running out of material)
I got 2 problems that I am sure could be easily sorted with 2 spreadsheets and some Python
Problem 1, when I m out for a delivery I usually know there are some of my customers around that might want to buy my products, however as I am driving is just impossible to stop my car and try to call one by one to figure out who needs my products.
On my spreadsheet I could sort the list of potential customer using the first 3 characters of their POSTCODE as it would tell me how close they are, I could pick the 3 customers below and 3 customers after the postcode I am delivering.
customer_name Cust_whatsapp Customer_Postcode Jan_purc Feb_Pur
John +551196194988 03650000 Paint Glue
Mary +5511999054333 03750000 Paint none
Paul +5511999999999 03760000 Glue none
Question 1 - what can I do in Python to go to my sheet and select a group of customer's postcode by proximity of address I am delivering ( It would be also nice if they could be automatically sent to web.whatsapp so I could send them a message.
Problem 2
On a second spreadsheet I have the purchase history, I woul love to be able to predict when my Customer is ready to buy again.
Question 2- Is it possible to create a simple code to read all purchase history from columns and give me a hint of when they are more likely to buy again? some output in a third spreadsheet with a list ordered by most likely to need, this way I dont need to do it by chance and keep skipping customers to my competitors
Hey Man, even if I don't get a reply, I still love what you do, sharing knowledge is the best thing a person can do! Sooner or later I will figure out how to do it.
Cheers
Henrique
I would suggest you hire a coder for your needs. Because as far as I see your business is selling items and not coding.
In python maybe Pandas and some grafic plot modules like matplotlib can help. Not sure about your live location tracking and clients nearby though.
Good luck
i like it
What's the text editor name??
Sorry for the delay! I use Atom in my tutorials with the platformio-ide-terminal package for the little terminal at the bottom. Happy Coding!
Shorter code(Not faster though):
def insertion_sort(lst):
for i in range(1, len(lst)):
while i > 0 and lst[i] < lst[i-1]:
lst[i], lst[i - 1] = lst[i - 1], lst[i]
i -= 1
return lst
💯
why are we using i = i-1 ??
We have to compare the current element with the left element down the list
Even I didn't get it. Coz we are already comparing elements to left in the while loop itself so why i=i-1 again?
@@atod2572 we are using i=i-1 coz we are not just using the left element, I'd the left element is not larger it will check the left of left till zeroth index
Hope you got it now.
Don't check for just i=1
Check for say i=4 or 5
Then you will get it.
Website: visualgo.com
And check for insert sort
@@anshulvairagade1604 thanks 👍🏻
he looks exactly like luke from percy jackson
Is this code correct?(it's too easy n small. i have exams today and can't afford a mistake) . No offense.thanks.
Why do you always look like if you were drowning in the sea and subtly emerged to take air
anyone is forcing u to SPEAK
SPEAK master anyone has instructed long ago
@@CodeWithDerrick SIR PLZ BE ENERGETIC
AND PLZ ADD SOUND BEHIND YOUR VOICE
@@amanahmed6057 Let him teach the way he does without music, most of us here are not to spend some good time listening to music but to learn concepts that are skipped or explained casually by professors at our universities.
@Aman Ahmed. No music needed thank you. Calm soft voice is good for such topics.