site Search Results

Results for: Andrew Koenig

Abstractions For Binary Search, Part 10: Putting It All Together

After the discussions of the last few weeks, we are finally ready to build our test cases. - C/C++

Farewell, Dr. Dobb's

After 38 years of glory, the long run of Dr. Dobb's has come to an end. - Design

Abstractions For Binary Search, Part 9: What Do We Need to Test?

Many people confuse the idea of a test case working correctly with the idea of a program producing correct output. - C/C++

Abstractions for Binary Search, Part 8: What Does It Mean To Say "It Works?"

Last week, we talked in general terms about how to test a binary-search function. Now let's get specific. - C/C++

Abstractions For Binary Search, Part 7: Choosing Test Cases

Binary search is a particularly instructive algorithm to figure out how to test. - C/C++

Abstractions For Binary Search, Part 6: How On Earth Do You Test It?

We will reduce a substantial part of our problem to calling these two functions repeatedly with suitably chosen test cases and verifying that they return the same results. - C/C++

Abstractions For Binary Search, Part 5: Getting Down to Details

It's hard to imagine how this code could be much simpler. However, we don't actually know whether it works. - C/C++

Invariants for Binary Search, Part 4: Using The Improved Abstractions

We continue our discussion of how to implement our binary search in an n-element sequence. - C/C++

Invariants for Binary Search, Part 3: Improving Our Abstractions

With this abstraction under our belts, we can proceed to write code. If you're interested, you might like to do so for yourself before I show you the details next week. - C/C++

Invariants for Binary Search, Part 2: Refining The Specifications

This week, we will try to define more carefully the problem we would like to solve before leaping into the solution. - C/C++

1 2 3 4 5 6 7 8 9 10 Next