Insertion Sort Algorithm

Visual description of the insertion sort algorithm

[@Hytension]

Khan does coding videos too, I thought they were just helping me become a mathematician. Bless

[@MahirDheendsa]

how does he know everything from comp sci to econ to stats to bio

[@genericperson8238]

The general idea is that the more you know the easier it is to pick up new things that are *somewhat* related to what youre picking up. Also he can simply research and learn about topics he didnt know before if doing videos.

[@raivatshah7847]

Cause he is Sal Khan

[@siddharthrajan616]

Yeah that's my doubt too. Seriously math,phy,coding etc... He is one of our biggest inspiration. However doesn't it make him jack of all trades and master of none??

[@geekyprogrammer4831]

@@genericperson8238 he did his MBA from Harvard and prior to that he did Electrical and Computer Engineering in MIT. So academically, he have covered everything.

[@phillipyoung8773]

He is a jedi

[@coldsummersky69]

Appreciating this channel more and more everyday.

[@Sindoku]

Insertion sort finally clicked for me after seeing this video, thanks for posting it! I feel like I can learn anything from you.

[@waqasusmans]

Some words reflect the importance of al-Khwarizmi's contributions to mathematics. "Algebra" is derived from al-jabr, one of the two operations he used to solve quadratic equations. Algorism and algorithm stem from Algoritmi, the Latin form of his name. His name is also the origin of (Spanish) guarismo and of (Portuguese) algarismo, both meaning digit. (From Prof. Wikipedia)

[@PressStartLetsPlay]

Khan Academy Could you possibly do a video on Big Oh Notation?

[@SmashBrosBrawl]

big O in a nutshell is the upper bound on how many comparisons an algorithm makes, for example if you have two For loops, you will have N^2 amount of comparisons, thus the upper bound is O(N^2). Binary search does Log2(N) comparisons, so that is it's O(N^2). Big Omega is the lower bound, and Theta is between Big O and Big Omega.

[@flosset6070]

best explanation. Thank you!

[@CrazyKangaroo81]

Really helpful video, Thank you

[@waqasusmans]

@junior1984able The name algorithm comes from the Middle Eastern polymath: Abū ʿAbdallāh Muḥammad ibn Mūsā al-Khwārizmī, earlier transliterated as Algoritmi or Algaurizin, (c. 780, Khwārizm - c. 850) was a Persian mathematician, astronomer and geographer, a scholar in the House of Wisdom in Baghdad.

[@therobertsons2525]

thankyou ian for showing me this video

[@giorgosma]

your video was very helpfull i finaly got that algorithm thx you

[@seahmadnailal-darabi8985]

Very perfect

[@guptayash4]

Really Helpful... :)

[@Leena20121996]

Sal, there's a small request plz start a JAVA playlist too. Right from the basics....! This video was great!

[@Gtajora]

Have my babies!

[@memeriyawtube6954]

thank you

[@Ntamakoupa]

I LOVE YOU

[@jreylbc1]

An algorithm is a set of unambiguous finite steps for solving a problem. A classic example of an algorithm is a cooking recipe.

[@abubakarsoomro2052]

kya baat kya baat xD

[@hamdhiharis6760]

Why these not available in the legendary app

[@shenglanliu4197]

Can you explain this procedure insertion sort(a1, a2,…, an: real numbers with n ≥ 2) for j := 2 to n i := 1 while aj > ai i := i + 1 m := aj for k := 0 to j − i − 1 aj−k := aj−k−1 ai := m {a1,…, an is in increasing order}

[@Khairan_Almolaiki]

thank you very much and i wish show video by language arabic

[@ziyancheng8122]

Maybe it's not. The swapping process is like the bubble sorting instead of insertion sorting.

[@mabhinavbunny]

hats off khan academy

[@SmoothJazzVideos]

WHy are you using Python instead of PHP?

[@GR4MPI]

So there is more comparisons than swaps, because you need to compare before you swap, and if you compare and its already sorted you dont swap am i right ? :D

[@MexterO123]

Salman Khan, is there anything your not good at, dude? XD You made this a clear as day for me, thanks. /)

[@NIAMProductions]

is this just like bubble sort? or does this only swap once per iteration?

[@voyasart]

Nick Manolov only swaps once per iteration

[@dappledore]

Is big O notation coming?

[@deathmoonkiller]

what's the difference between Bubble Sort and Insertion Sort? They both comparing the neighbours until they're sorted?

[@min_808]

Well, bubble sort goes through the array, comparing each number with its previous number with every pass until the highest number is on the right. Then it goes back to the start to repeat. However, with insertion sort, the numbers are placed in their correct position.

[@jakeambrose4294]

i watch and wonder how long it will be before i consider myself a killer python programmer? to make it interesting ill come back to this comment when i am.

[@jeenajavahar7499]

killer programmer yet?

[@TooWongCool]

I'm subscribing to this comment. Hope you make it to killer programmer status!

[@barbie379]

David Ramirez how to subscribe to a comment?

[@TooWongCool]

Barbie Lee. If you comment on any other comment or post, you will be notified when a new comment or reply is added to that comment. So you just subscribed to this comment too!

[@barbie379]

David Ramirez wow ok thank you!!

[@TheHTMLCode]

Does it really matter, he could have done this in C#, Java or any other language, the principle is still the same...

[@AR-rr7we]

CAN YOU PLEASE DO VIDEOS ON JAVA!!! PLEASE!

[@Se7_7]

This is not an algorithm

[@junior1984able]

what's a algorithm?

[@nandininandakumar381]

It is a step by step procedure for solving a given problem. It can be implemented in any suitable programming language. Remember it is a finite set of instructions.

[@Bushra.studio]

It is 11 years later😢 How r u ?

[@chetansingh4554]

Exam are coming like nuclear bomb here in India.....khan ji.....please explain OPPS concept in detail .....other wise i will fail