Time complexity of an algorithm indicates the total time needed by the program to run to completion. It is usually expressed by using the big O notation. Big Oh: It indicates “fewer than or the same as” iterations Big Omega: It indicates “more than or same as” iterations Big Theta: It indicates “the same as”iterations Little Oh: It indicates “fewer than” iterations Little Omega: It indicates “more than” iterations