site Search Results

Results for: Andrew Koenig

Sorting An Immutable List

This article continues last week's discussion by explaining how to sort an immutable list. - C/C++

How Do You Decide On Intermediate States?

For both iterative and recursive functions, a key programming strategy is to ask a single question: What information do we need to store while a computation is in progress? - C/C++

Reversing an Immutable List

Reversing an immutable data structure in place would be a contradiction in terms; so instead we must define a reverse function that takes a list and returns its reversal. - C/C++

Introduction to Programming with Lists

This post should start to give a feel for what it's like to program with immutable lists. - C/C++

A Simple, Immutable, Node-Based Data Structure

We continue the discussion of programming without mutable data by looking at what operations make sense for such data structures. - C/C++

What Does It Mean To Change An Object?

If you want to be able to augment a data structure in a uniformly efficient way, it seems to be necessary to use a node-based structure rather than an array-based one. - C/C++

Containers That Never Change

Andrew responds to a reader's question about last week's post. - C/C++

Programming Without Variables

Replace a loop by a function that uses only tail recursion. - C/C++

Theory Versus Practice: The Great Divide in Programming Languages

Do programs exist in order to tell computers what to do, or do computers exist in order to execute programs? - C/C++

Addresses and Nodes: Two Ways To Get Around

Programs that avoid address arithmetic can also avoid moving data. The reason is that it is only arithmetic that really cares about where in memory an object is; in other circumstances, having a pointer to that memory is enough. - C/C++

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