Complete Space and Time Complexity in Data Structure and Algorithms
Nobody has claimed this yet.
Assessment
- Difficulty
- 1/5
- Estimated time
- 1-3 hours
- Newbie friendliness
- 45/100
- Issue type
- Documentation
- Clarity
- Mostly clear
- Activity status
- Quiet
- Domain
- documentation
Research direction
Start with the linked time-complexity and space-complexity coursework. Read both resources and use the listed questions to check your understanding of Big O notation, common complexities, sorting algorithms, and nested loops; there is no submission step, so completion means finishing the reading and making personal notes.
Written by the indexing model from the issue text.
Description
Link to the coursework
https://www.wscubetech.com/resources/dsa/time-complexity
Learning Objectives
- Define Big O notation
- List 8 common levels of time complexity
- Identify the time complexity of given common (named) algorithms
Why are we doing this?
This is a primer on space and time complexity. It's basically a reference guide. You do not need to memorise this information. Read through it and make notes for yourself. Make sure you can answer the following questions:
- What is Big O Notation?
- Which has a higher complexity, bubble sort or timsort?
- What's the problem with nested loops?
Complete
- https://www.wscubetech.com/resources/dsa/time-complexity
- https://www.wscubetech.com/resources/dsa/space-complexity
Maximum time in hours
3
How to get help
Share your blockers in your class channel
https://curriculum.codeyourfuture.io/guides/getting-help/asking-questions/
How to submit
No submission step. This is background reading for your own understanding.
Anything else?
Enjoy this folk dance bubble sort: https://www.youtube.com/watch?v=Iv3vgjM8Pv4
- Dominant language
- Python
- Stars
- 0
- Forks
- 60
- PR merge metrics
- No merged PRs in 30d
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from CodeYourFuture/Module-Complexity
-
NotCoursework
Difficulty 1/5 Under an hour Newbie friendliness 75/100
-
🏕 Priority Mandatory 📅 Sprint 2 Core Module-Complexity Submit:None 🦔 Size Tiny
Difficulty 1/5 Under an hour Newbie friendliness 82/100
-
🏕 Priority Mandatory 🐇 Size Small 📅 Sprint 2 Module-Complexity Submit:None
Difficulty 1/5 1-3 hours Newbie friendliness 72/100
-
🏕 Priority Mandatory 🐇 Size Small 📅 Sprint 1 Core Module-Complexity Submit:None
Difficulty 2/5 1-3 hours Newbie friendliness 55/100
-
🏝️ Priority Stretch 📅 Sprint 2 🦑 Size Large Module-Complexity Optional Submit:PR
Difficulty 3/5 Half a day Newbie friendliness 45/100
All issues in CodeYourFuture/Module-Complexity
Similar issues
-
Add: hunch Open
Difficulty 2/5 1-3 hours Newbie friendliness 74/100
AbdelStark/awesome-typesafe#104 ·
-
enhancement
Difficulty 2/5 1-3 hours Newbie friendliness 72/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 68/100
DiamondLightSource/dodal#2211 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 88/100
openml/openml-python#1749 ·
-
Difficulty 2/5 1-3 hours Newbie friendliness 88/100
sipyourdrink-ltd/bernstein#6191 ·