site Search Results

Results for: Andrew Koenig

Invariants For Binary Search, Part 1: A Simple Example

We can use an invariant to help us reason about a piece of code that many programmers find hard to get right by any other means. - C/C++

Loop Invariants And Testing: Often Possible, Often Difficult

We can think of an invariant as being a claim or belief about the state of program that we expect to be true each time control reaches a particular point in the program. - C/C++

A Loop Invariant Can Be An Optimization Tool

This week, we'll look at the helpful qualities of loop invariants. - C/C++

Using a Loop Invariant to Help Think About a Program

Last week, I talked about how to write a loop invariant. I would like to continue this discussion by paraphrasing a beautifully elegant example that Dijkstra used in A Discipline of Programming. - C/C++

Loop Invariants Abbreviate Induction Proofs

It is often possible to avoid difficulties by proving the desired properties of our program by induction. - C/C++

Mathematical Induction Makes Extrapolation Accurate

Mathematical induction is a technique for using the properties of natural numbers to prove claims about every natural number. - C/C++

Sanity Checking By Extrapolation

It may be tempting to dismiss last week's problem as trivial, and argue that one should simply be able to construct a bunch of test cases and be done with it. However, it may not be easy to determine the correct results. - C/C++

Why Testing Isn't Enough

Last week, I stated that software is hard to develop. This week, I would like to concentrate on two of the reasons why. - C/C++

Why Is Software So Hard To Develop?

Software is hard to develop for many reasons: We must figure out what to do, do it, and ensure that we have done it correctly. - C/C++

A Second Try at Refactoring Dijkstra's Example

If you compare my code with Dijkstra's original solution, you will see that in an odd way they are nearly logical duals of each other. - C/C++

Previous 1 2 3 4 5 6 7 8 9 10 Next