In this thread we discuss our progress reading “Introduction to Algorithms, Fourth Edition”.
We gather every Saturday and Sunday at 12:00 (noon) UTC.
Reading goals for next Saturday:
Chapter 3
I've extended the time we have to finish chapter 3 because I was pretty busy with work this week.
Did you get through all of this week's content? Let us know if you think we are going too fast or too slowly.
Today's discussion questions:
Name a loop invariant property which is not mentioned in the book, and prove that it is loop invariant.
2.1-4 Write pseudocode for linear search, which scans through the array from beginning to end, looking for x . Using a loop invariant, prove that your algorithm is correct. Make sure that your loop invariant fulfils the three necessary properties.
You will gain the most by doing the exercises and problems yourself!
Spoilers are not enabled on this board, so please not post solutions for exercises or problems for sections:
3.1 and beyond
Notable changes from the third edition for this week’s content:
None
Previous thread:
