Tag Archives: algorithms

Efficient prime number testing

In nearly every lower-level CS class, students are invariably asked to create a function that can recognize a prime number. There are very good reasons for this. For one thing, the study of prime numbers is one of the longest-running … Continue reading

Posted in Programming | Tagged , , | Leave a comment

The Double Baggins

(This post originally appeared on my Digication site.) As a (non-gradable) challenge for BHCC’s Data Structures course, Prof. Richmond challenged us to come up with a new sorting algorithm. This is the one I came up with.

Posted in Programming | Tagged , , | Leave a comment