1
00:00:00,480 --> 00:00:08,610
‫So when dealing with time and space complexity, you will see these three Greek letters.

2
00:00:09,270 --> 00:00:17,790
‫They are Omega Theta and Omicron Omicron is better known as O, as in Big O.

3
00:00:18,180 --> 00:00:24,540
‫And to show how we use these, I'm going to bring up an array and say we're going to use a for loop

4
00:00:24,540 --> 00:00:26,430
‫to loop through this array.

5
00:00:26,880 --> 00:00:33,120
‫So when we're looking at how many times that we have to run the for loop, our best case would be if

6
00:00:33,120 --> 00:00:35,430
‫we're looking for the number one.

7
00:00:35,970 --> 00:00:42,600
‫Our worst case would be if we were looking for the number seven and our average case would be if we

8
00:00:42,600 --> 00:00:44,820
‫were looking for the number four.

9
00:00:46,110 --> 00:00:55,080
‫So this best case with the number one for that we use Omega for the average case, we use the Greek

10
00:00:55,080 --> 00:01:02,900
‫letter theta and for our worst case, we use the Greek letter Omicron or O.

11
00:01:03,210 --> 00:01:09,270
‫So one of the things people will say when you talk about your big O being a particular time complexity

12
00:01:09,270 --> 00:01:14,970
‫is they'll say things like, Yeah, but what is your average big O or your best case big O?

13
00:01:15,510 --> 00:01:20,130
‫Well, technically there is no average case or best case.

14
00:01:20,130 --> 00:01:21,000
‫Big O.

15
00:01:21,000 --> 00:01:25,560
‫Average case would be theta and best case would be omega.

16
00:01:26,070 --> 00:01:29,610
‫But you will hear people use it in that way.

17
00:01:29,610 --> 00:01:35,460
‫But technically big o is always worst case.