- Why estimate runtime complexity over, for example, number of statements?
- How does runtime complexity relate to math functions?
- Is the complexity class that is typically provided the best or worst case?
- Why are loops important in estimating complexity?
- Is O(n log(n)) a better or worse runtime complexity than O(log(n))?
- What are some commonly known complexity classes?
Germany
Slovakia
Canada
Brazil
Singapore
Hungary
Philippines
Mexico
Thailand
Ukraine
Luxembourg
Estonia
Lithuania
Norway
Chile
United States
Great Britain
India
Spain
South Korea
Ecuador
Colombia
Taiwan
Switzerland
Indonesia
Cyprus
Denmark
Finland
Poland
Malta
Czechia
New Zealand
Austria
Turkey
France
Sweden
Italy
Egypt
Belgium
Portugal
Slovenia
Ireland
Romania
Greece
Argentina
Malaysia
South Africa
Netherlands
Bulgaria
Latvia
Australia
Japan
Russia