In lecture we discussed the binary search algorithm which searches a sorted array for a key and returns either the index of where it was found, or if not found, returns the index of where it belongs. In such a case this belongs index is encoded as a negative number to distinguish it from being confused with a found index. The encoding is as follows: add $1$ to index then negate. In lecture we also discussed the insertInOrder algorithm which reads a sequence of values from a source $($ text file$)$ and inserts them into an array keeping them sorted as each value is added to the array.