London | 25-SDC-July | Mikiyas Gebremichael | Sprint 1 | Analyse and refactor #34
Conversation
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
2 similar comments
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
Mikiyas-STP
added
📅 Sprint 1
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
3 similar comments
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
Mikiyas-STP
changed the title
|
Your PR couldn't be matched to an assignment in this module. Please check its title is in the correct format, and that you only have one PR per assignment. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
Mikiyas-STP
changed the title
|
Your PR description contained template fields which weren't filled in. Check you've ticked everything in the self checklist, and that any sections which prompt you to fill in an answer are either filled in or removed. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
|
Your PR description contained template fields which weren't filled in. Check you've ticked everything in the self checklist, and that any sections which prompt you to fill in an answer are either filled in or removed. If this PR is not coursework, please add the NotCoursework label (and message on Slack in #cyf-curriculum or it will probably not be noticed). |
cjyuan
left a comment
cjyuan
left a comment
There was a problem hiding this comment.
is there any tool to analyse the complexity of a big code base? since it is quite complecated to analyse thousands of lines of codes with a short time?
I am not aware of any tools that can directly analyze the algorithmic complexity of an entire codebase, although modern AI systems may be able to approximate this to some extent.
In practice, performance analysis more commonly relies on profiling tools, which measure where a program actually spends its execution time, allowing developers to focus optimization efforts on the slowest parts.
| // And The area of inefficiency for this code is on the loop (i.e. looping twice) | ||
|
|
||
| //refactored code for better efficiency. | ||
| //what i have done here is i use a single loop to change the efficiency from o(2n) to o(n) |
There was a problem hiding this comment.
In complexity analysis, O(2n) is the same as O(n); we ignore the constant factor.
In terms of efficiency, combining the loop is a good idea in practice.
cjyuan
added
Complete
2 participants
Learners, PR Template
Self checklist
Changelist
In this repo i analysed an algorithm's complexity and refactor the code for better complexity/less expensive space and time.
Questions
is there any tool to analyse the complexity of a big code base? since it is quite complecated to analyse thousands of lines of codes with a short time?