wehub-resource-sync
dde272c4b8
i18n - Build Validation / Validate i18n Builds (24) (push) Has been cancelled
CI - Node.js / Lint (24) (push) Has been cancelled
CI - Node.js / Build (24) (push) Has been cancelled
CI - Node.js / Test (24) (push) Has been cancelled
CI - Node.js / Test - Upcoming Changes (24) (push) Has been cancelled
CI - Node.js / Test - i18n (italian, 24) (push) Has been cancelled
CI - Node.js / Test - i18n (portuguese, 24) (push) Has been cancelled
CD - Docker - GHCR Images / Build and Push Images (push) Has been cancelled
433 B
433 B
id, title, challengeType, videoId, dashedName
| id | title | challengeType | videoId | dashedName |
|---|---|---|---|---|
| 698dc8ae7932b3cc4b19c925 | Determining Complexity | 11 | 8bglWlQYTPQ | determining-complexity |
--description--
In this video, you will learn how to determine the worst case complexity for an algorithm.
--questions--
--text--
What is the worst case runtime for binary search?
--answers--
O(n)
O(log n)
O(1)
O(n log n)
--video-solution--
2