-
-
Notifications
You must be signed in to change notification settings - Fork 14
Glasgow | Sheetal Kharab | Module-Complexity | Sprint 1 | Analyse and refactor #32
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Glasgow | Sheetal Kharab | Module-Complexity | Sprint 1 | Analyse and refactor #32
Conversation
| * Time Complexity: | ||
| * Space Complexity: | ||
| * Optimal Time Complexity: | ||
| * Time Complexity:O(2n) originall have this as using 2 separate loops |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
O(n) is the same as O(2n). We ignore the constant multiplier in big-O notation.
| * Time Complexity: | ||
| * Space Complexity: | ||
| * Optimal Time Complexity: | ||
| * Time Complexity:O(n+m) it build set and loop through arrays once |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What's the complexity of Array.include()?
.filter() suggests a "loop", and inside the loop .includes() is called repeatedly.
| * Optimal Time Complexity: | ||
| * Time Complexity:O(n+m) it build set and loop through arrays once | ||
| * Space Complexity: store second array in set | ||
| * Optimal Time Complexity:O(m+n) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
We could also write O(max(m, n))
Learners, PR Template
Self checklist
Changelist
refactor code
Questions
No