Searches for the first occurence of the given argument.
Searches for the first occurence of the given argument. This method has a time complexity of O(N), with N being the size of the list.
This method has a time complexity of O(N), with N being the size of the list.
Alphabetic index