What is Big O Notation in Algorithm

Big O notation is a specific notation that indicates the speed of an algorithm. When you use others’ algorithms in your project it is necessary to calculate Big O notation. It will help you to know how fast or slow it will work in your case. To know more about Big O notation visit HERE Algorithm run-time at different rates Alex is working on a SpaceX search algorithm. When a rocket is poised to arrive on the Moon, his algorithm will kick in and assist in determining where to land. The Algorithm he has to use … Read more

Binary Search Python – Searching Algorithm

Binary Search Python is an optimized search algorithm to find a variable in an Ordered array or list. Suppose I have to find supercalifragilisticexpialidocious in a dictionary: Dictionary is an ordered list. (A-Z) I will not find the word in the start because its starting character is not A. Suppose I open a page randomly in … Read more