A Common-Sense Guide to Data Structures and Algorithms, Second Edition: Insertion Sort Break Condition (page 85)

Community PragProg Customers
,
1

@jaywengrow

I have noticed a mistake regarding the break condition for the insertion sort algorithm.

Currently, the paragraph is as follows:
“If at any point we encounter a value at position that is greater or equal to the temp_value, we can get ready to end our pass-through, since it’s time to move the temp_value into the gap”

I believe the author intended to say “less” instead of “greater”, i.e.
“If at any point we encounter a value at position that is less than or equal to the temp_value, we can get ready to end our pass-through, since it’s time to move the temp_value into the gap”