Tree - Binary Tree

Algorithm - Complexity (Big O)

Complexity is based off of how the algorithm scales for very large n. Constants and lower-order terms are dropped. For example: will execute in constant time a model that takes time has complexit "...

Ordinal Data - Merge sort Algorithm

John von Neumann invented merge sort in 1945. It requires O(n log n) comparisons. A sorting algorithm for rearranging lists (or any other data structure that can only be accessed sequentially, e.g. fi "...

Tree - Depth-First Search (DFS)

Depth-First Search is a tree traversal in a depth-frist order. ie The search tree is deepened as much as possible on each child before going to the next sibling. Algorithm At node N, in any order: (L "...