This article explores a number of ways of performing a find/replace and compares the various implementations for different sizes of the find/replace list and input text.
Sets are an important concept and extremely useful in various computer science applications. We take a look at some of the ways a set data structure can be implemented.
Heaps and Queues can be a powerful data structure. This article goes into the implementation of a binary heap and extends the data structure to act as a priority queue.
Here we look at recursive functions in Python, and explore some ways of avoiding the maximum stack depth limit by using alternate functions like reduce().