Похожие чаты

How to count Big-O notation for if statement?

8 ответов

13 просмотров

I dont know anything about these notations (All i know is O(n) means n operations can be done for a job) but i guess it should be 2n+1 n + 1 for the for loop (which you can rewrite it and make it n) and n for the arr[i] == x

Ive searched a little bit seems im right with 2n+1 but I also got that O(an+b) is equal to O(n) somehow

Farkhan°᭄- Автор вопроса
Farkhan°᭄
screenshot is it what you mean sir?

No For loop is n + 1 and "if" is n

Nader Jafari
Ive searched a little bit seems im right with 2n+1...

It's just limit (shouldn't have used it) maximizing. Since N tends to infinity. aN + b, here b won't really matter and aN, N will be the same

Farkhan°᭄
screenshot is it what you mean sir?

You can just eyeball the operations, its O(n) since its iterating over the whole list

Take an algorithms course, there's one by mitopencourseware. Google it to find it

Похожие вопросы

Обсуждают сегодня

Карта сайта