Answer 1

really you just have to analyze the algorithm and see what it does to figure out the best/worst time complexity. for example, linear search:

best case scenario: element is at the beginning, that means the time complexity is O(1)

worst case scenario: element is at the end, that means the time complexity is O(n)