Big "OH" Before we proceed we must know what the below graph means If you are wondering what it means let me be very straight forward to you. "You have to write your algorithm with time and space complexity near or below the purple line" When someone asks you to calculate Big-O, you do the below things and you are golden : 1. Worst Case Scenario Always consider the worst case scenario. As yourself this, question a million times."What if the input is huge, like a million or a trillion ?" If you have to check no of times a string occurs in an array, you would go for a for loop which will loop through the elements and keep increment a counter, which has a complexity of O(N) where N is the number of inputs. Always think, what will happen when N reaches a million or a trillion. How will your code perform. 2. Remove Constants - I have added the Big-O complexity to the code. Final complexity is 2*O(1) + 2*O(N) If we consider th...
Its a curse and a blessing