Insertion Sort | C++ Example 

I'm glad you enjoyed it! :-)

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

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.

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].

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

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

I’m glad you enjoyed it! :-)

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

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

😂

Exact same here lol

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?

@@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.

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; } }

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

Aww you’re welcome! :-)

@@PortfolioCourses can I know that where are you from

@@yaseries2004 I am from Canada. 🙂

Thank you for reading my comments

You look like Henry Cavill 🤔

You're very welcome! :-)

You're very welcome Frits! :-)

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

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?

Sir your instagram I'd

@@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?

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

Sorry to hear that!