nbro

`None` is an object of type `NoneType`. However, in many cases, I specify that the type of parameter or return value is `None`, but this latter is an object, so...

The idea behind citing resources in every module is to tell the user (of this software) which resources the algorithm or data structure's implementation is based on, so that to...

This project wasn't started as a TDD project because, at that time, I didn't know much about these techniques. ### Questions - Why would or not TTD be the most...

This project also aims at implementing algorithms which asymptotically are faster than their eventual alternatives. Nevertheless, asymptotically slower alternatives are not excluded: on the contrary, they may serve as a...

Here's an enumeration of the data structures and algorithms that still need to be tested: ### Data Structures - [x] `TST` - [x] `Queue` ### Algorithms All algorithms under: -...

For example, in the case of heaps, I'm currently providing an additional non-standard method, i.e. `delete`, for all binary heaps (`MinHeap`, `MaxHeap` and `MinMaxHeap`), but `delete` is usually not an...

Which properties of a numerical algorithm should be tested? Does the answer to this question depend on the specific numerical algorithm? ### Possibly useful resources to answer these and related...

It should be possible to customise/choose the (current) hash function of the [`HashTable`](https://github.com/nbro/ands/blob/master/ands/ds/HashTable.py) data structure without affecting the general behaviour of the same, but at most its performance. _I should...

- [x] size (number of elements in the data structure) - [x] contains (checks if an element is in the data structure) - [x] sets (number of sets in the...

The concept of a tail-recursive function is especially important for functional programming languages. A tail-recursive function can be implemented in an optimized way by reusing the existing stack frame when...