Solving NP-Complete Problems Faster Part 1 – Sequence Reduction
Disclaimer This article is a little more advanced than previous ones but will still be useful to programmers of all skill levels. To get the most from this article I suggest running the attached code locally, then reading what I have to say about it. I rushed to get this out so there may be … Continue reading “Solving NP-Complete Problems Faster Part 1 – Sequence Reduction”
Virtual Indexing Part 8: The Indexed Splitter Function
The fastest way to split a string is to have already done so.
Virtual Indexing Part 7: Finite Opposite Numbers
Virtual Indexing continues…How do we to avoid sorting in either direction (ascending and descending)?