Algorithms #2 - Insertion Sort

[Diamorotic]

2 people took an arrow in the brain.

[Bowser3366]

love your work! !!

if only lecturers would provide such proper examples

and not just read out their pre determined slides.

[podypodpod]

did you ever consider becoming a magician?

[lightswitchlarry]

This visual way of tutorial that you have done has really explained it better to me than the other videos i have seen on insertion sort. Thanks man

[bunnythegreat216]

heyy, awesome job, u saved my assssss

[lia86x]

gosshhh!! would you mind talking a bit clearly???

[viczsaurav]

Can you show how to calculate the find the O(f(n))[order of the Sorting algorithms]. Thanks a ton..!!! The calculation of the Time Complexity..

[viczsaurav]

Can you show how to calculate the find the O(f(n))[order of the Sorting algorithms]. Thanks a ton..!!!

[drive2468]

NO ENTIENDO NADA

ES UQE SOY ESPAÑOL

JEJE

[hellraidzor]

clear and conscise

[Mesmereyes]

Gr8 Video!! It does a good job at showing the comparisons required for each swap in the algorithm. Nice work

[MrLemonyFresh]

Thanks for the tutorial, but I had trouble hearing you at times.

[oOPrincessMoonieOo]

thanks for the video, I wish my teacher would explain things that way :( !

[MrLYN274]

thnx man, u really helped me :))

[KieranLaff]

hey just wanted to say thank you for taking your time to make this! very useful :)

[SerGrimson]

Thank you!

[xgzipx]

This is not how the comparison works in the insertion sort. it should be from right to left.

[LuvLP4ever]

Thanks so much. I'm competing in the Canadian Computing Competition tomorrow and ur algorithms really helped me out. :)

[Laucheehung]

thanks for the help man - helps for my exam

[Jinx8602]

thanks alister christie!

[smeezh]

oh wow a video was so much easier to understand than trying to read it online. thanks!

[zeekyboogydude]

Very nice video. Do you think merge sort would be too hard to explain?

[codegearguru]

I mostly made a merge sort video, but didn't like it. I'll have another try soon - merge sort is actually really easy to explain.

[Rafdaganga]

the only thing better about Insertion is space complexity.. slighty

[dewi20]

thanks alot!!

5 stars!!!

[tylerdurdenbp]

hero of explanation

[Ciwan2]

Nice, I now fully understand it.

Thank you soo much :)

[iPrometheusQ]

I'm not quite sure but don't you have to compare the previous card in the array and then the pre-previous and so on till the card you compare with is smaller than yours?

You always start at the beginning of your array. I think the original Insertion sort is written this way because it's an efficient algorithm for partial prearranged arrays

[judastrii]

thanks man

[ingrambo30]

Thank you so much. Your guide has been very useful. Congratulations!

[BDCTA]

Nice tuts, Is this learned in Computer Science?

And do you code much, my thoughts are that they teach you the algorithm and you produce it in code (language of your choice), am I correct?

[codegearguru]

Thanks, yes I learned these algorithms in my first year computer science course - although I've never really had to code up a sorting algorithm (I've always been able to use an existing library). However I do believe that it is important to know how these things work - and their performance - which I haven't talked much about yet.

I do spend a fair amount of time coding - mostly developing applications for the Real Estate industry.

[BDCTA]

Ok :)

You code Delphi or something?

I think I've seen your tuts;

I'm currently learning C++, looking around but can't find any local colleges that teach computer science :(

[obituary123]

thanks!!!

[WilliamNz123]

cheers 4 the vid! exam tmrw :) did u do 220 at AKL uni?>

[codegearguru]

No I studied at Victoria in Wellington.

[Mitsimad]

@codegearguru I was about to ask if you were from NZ but now I see you studied where I am currently studying haha

[exosfear512]

Very helpful, thanks for the effort, is it possible for you to show us Merge Sort or even Selection Sort with your pack of spades? ... or maybe even Quick Sort (but that will be asking too much)?

[codegearguru]

I need to borrow a video camera again to make more. Quick Sort is actually fairly easy to do with cards (I think there is already a non-English youtube video). I'll get around to it eventually.

[lounigccman]

THANKS,I LOVE YOUR LESSON VERY MUCH~

[xazzy17]

I recognize the tell-tale punch hole in the middle of those cards. Looks like someone's been hanging out at the Sky Casino ;-)

[codegearguru]

Yes - well spotted!