time complexity

Question 1

what is time complexity

Answer 1

time complexity of an algorithm describes how time taken to execute it grows with the size of the input data
- time complexity does not indicate actually performance

Question 2

linear search, insert remove

Answer 2

search: O(1)
insert: O(n)
remove: O(n)

Question 3

linked list search, insert remove

Answer 3

search: O(n)
insert: O(1)
remove: O(1)

Question 4

binary search, insert remove

Answer 4

search: O(log(n)); worse case (O(n))
insert: O(log(n))
remove (leaf node/ one child node): O(1)
remove (two-child node): O(log(n))