Linear Search has a complexity of O(n), Selection Sort is O(n^2) and Binary Search is of O(lg n), you must have heard or read these statements a lot. But what do the terms “Complexity” and “Big O” mean? According to Wikipedia, Big O notation is a mat...
Markdown supported · ⌘↵ to post
No responses yet.