Big O of Notation

Today I learned a bit about "Big O of notation" from Mike. There are many algorithms that  a computer scientist can use but the career changing question is which one is the best? In the Big 0 notation is just the classification for different types of algorithms. There is Big 0(1) which is just going from position a in array to position b in an instant but it takes a constant time. There is also Big 0(n) which is using a key to find the value in the array, There's also more complex ones like Big O(n^2) which rises up more faster at an exponential rate and Big O(log[n]) which rises and goes to the right. So, basically all these different types of curves are types algorithms. And the best algorithm is the one that is the fastest. The algorithm that can get the value from the array the fastest is also more likely to be used to be implemented into databases and other things. Algorithms are crucial part of a computer scientist's career but I hope to learn more about algorithms  and the other areas of the field in time.