A Python function that parses through a sorted list (descending order) using a binary search method to determine if an element is present. Best case O(1), worst case O(log n), and uses very low memory.
This code is designed to allow one to find all autocorrect suggestions of a word based on the letters close to it on a given keyboard (the following examples using QWERTY). That is to say, if the string "trf" is given, "red" would be a good result (one key left on the keyboard for each letter).
A simple Python script that generates an array containing any numbers of the Fibonacci sequence based on their integer indices. Can also accept negative integers. If the correct parameter is specified, it will return the array as a string instead.