Insertion Sort | C++ Example

[@MetalWhale.]

Amazing! The commented example allowed me to finally understand the algorithm. I've watched several videos, read through my textbook, and this example is by far the best illustration of an insertion sort. Thanks.

[@ShyamKumar-cn9hb]

best explanation of code ever

[@PortfolioCourses]

I'm glad you enjoyed it! :-)

[@more-uv4nl]

amazing explanation

[@yuripanosyan5267]

Sir, your explanation is clearer than the God's soul!! Thanks!

[@PortfolioCourses]

You're welcome Yuri, I'm glad you enjoyed it! :-)

[@musabakhtar393]

can someone please explain the while loop area, like what is in a[ j ] or what is stored in it because I cant seem understand the whole loop specially a [ j ] and a[ j + 1 ]

[@tungno7]

easy to understand, thanks!

[@yaseries2004]

Thank you so much love you my dear sir,💐💐💐

[@PortfolioCourses]

Aww you’re welcome! :-)

[@yaseries2004]

@@PortfolioCourses can I know that where are you from

[@PortfolioCourses]

@@yaseries2004 I am from Canada. 🙂

[@yaseries2004]

Thank you for reading my comments

[@yaseries2004]

You look like Henry Cavill 🤔

[@default2043]

Very nice video! If I want to perform insertion sort in reveres order, then I need to switch "a[j] > key" to "a[j] < key", but unfortunately I will get a segmentation fault this way. Any ideas why this is and how to solve it?

[@Roq-stone]

In the for loop, to print, put i = 7 with i >=0, then decrement i (i-) This will reverse the array numbers. There you go. Sorted.

[@t6hp]

it's likely not due to the comparison operation (a[j] < key), but rather an issue elsewhere in your code that is causing out-of-bounds memory access. The switch in the comparison operator is indeed the correct approach to sort in descending order. Ensure that your loop indices do not cause you to access the array out of its bounds. This could happen if ScannerIndex goes below 0 and you still try to access arr[j].

[@Megha-sb2vu]

The example helped alot and cleared the concept even more!! Tysm 🪄

[@PortfolioCourses]

I'm glad it was helpful for you, and you're very welcome! :-)

[@gerdsfargen6687]

No way! Was just doing in Java. Mind reader!

[@PortfolioCourses]

Hahaha I think it's that time of year for insertion sort! :-)

[@gerdsfargen6687]

@@PortfolioCourses you just reminded me of Bugs Bunny and Daffy Duck. "Insertion Season! " "Bubble Season"....fire!

[@PortfolioCourses]

😂

[@yoruichi5802]

Exact same here lol

[@jaderose2886]

I love ur vids, but I think it would be really cool if you did some operating system content. Like how to create processes and all tht kinda stuff

[@PortfolioCourses]

Thanks Jade! :-) That's something I want to cover more of one day, in particular creating processes in C.

[@FritsvanDoorn]

Thank you

[@PortfolioCourses]

You're very welcome Frits! :-)

[@edensparkish]

Thank you!!!

[@PortfolioCourses]

You're very welcome! :-)

[@jonluis2647]

Best one out there👌🏼👌🏼👌🏼🫡🫡🫡🙏🙏🙏🙏

[@PortfolioCourses]

I’m glad you enjoyed it! :-)

[@KrumRashkov]

I love your videos and you are a really big help with all c and c++ related topics, thank you for putting out this amazing content. However, I was wondering if you can help me with a task given by my university. I have to make an insertion sort that performs the "descent" with an anchor. This means placing the inserted element at the "bottom" of the array to save from the "descend" end condition. Do you happen to have any idea how this could be done?

[@PortfolioCourses]

I'm really glad you enjoy the videos Krum, thank you for sharing that positive feedback! :-) I'm not sure I understand the question and what the anchor would be doing in the algorithm though. Do you have the question text? Was ChatGPT or Google helpful?

[@KrumRashkov]

@@PortfolioCourses hey thanks for the fast reply actually i tried running the question on gpt and phind and I also consulted with some people and no one including me seemed to understand what exactly is the question so I will ask the teacher. Thanks for reaching out though.

[@t6hp]

I think the question is just poorly formulated by the Professor, but what's being asked here is a reverse insertion sort, if I understood correctly. The anchor here is what Kevin refers to as the key, or the element being compared to all previous elements. You really change bigger than > to less than = 0) && (arr[ScannerIndex] < anchor); ScannerIndex--) { // Move the scanned element one position to the right to make space for the anchor arr[ScannerIndex + 1] = arr[ScannerIndex]; } // Once the correct position is found or the start of the array is reached, // insert the anchor. The ScannerIndex would have moved one place left of the // insertion point, so we need to insert at ScannerIndex + 1 arr[ScannerIndex + 1] = anchor; } }

[@ramakrishna4092]

Hi sir I have one doubt in post increment in c Int a=10; a= a++ ; If I print the value of a the output will be 11 right but why the output is 10 can you pls explain this Thank you..

[@PortfolioCourses]

i = i++ is undefined behaviour in C, this answer explains better than I would be able to: stackoverflow.com/a/26895433. :-)

[@4O8]

the sorting start from the leftside or rightside?

[@cseb-kathirvel2674]

Insertion sort in 2d string is it possible,pls try this program and c program for all types of errors pls upload the program

[@PortfolioCourses]

I'm curious what you mean by "all types of errors" Kathir? :-) Can you explain more about what types of errors you would be interested in seeing covered? Compiler errors? Or other types of errors that occur at runtime?

[@cseb-kathirvel2674]

Sir your instagram I'd

[@cseb-kathirvel2674]

@@PortfolioCourseshow to all compile errors and runtime errors in c pls upload video ,Why I am asking this question?This question was very important for college students.even I write a own program that time large numbers errors coming ,that errors why coming? how to solve the error?

[@cseb-kathirvel2674]

@@PortfolioCourses user input in sertion sort in 2d string in c upload this program and explain it

[@shashwatmishra4974]

Time and space complexity anyone please ?

[@shia9101]

is there a pseudocode of this sir?

[@PortfolioCourses]

There is a link to the C++ code in the video description, that might be helpful? :-)

[@touristofsongs4946]

I dont get a shit from this.

[@PortfolioCourses]

Sorry to hear that!