Assignment 2

[VictorKwong]

What changes are you trying to make? (e.g. Adding or removing code, refactoring existing code, adding reports)

Worked on Python, added explanations, analyzed the time and space complexity, and included examples and an alternative solution.

What did you learn from the changes you have made?

I learned how to analyze algorithm efficiency using Big-O notation and how different approaches can affect performance.

Was there another approach you were thinking about making? If so, what approach(es) were you thinking of?

I first saw my partner consider using a bubble sort approach, but I found that the two-pointer approach is more efficient because it runs in O(n) time.

Were there any challenges? If so, what issue(s) did you face? How did you overcome it?

The first time, I had difficulty understanding the time and space complexity. I overcame it by reviewing the algorithm step by step and comparing it with alternative solutions.

How were these changes tested?

I tested the solution using the provided examples and additional test cases to verify that the output matched the expected results.

A reference to a related issue in your repository (if applicable)

Checklist

• I can confirm that my changes are working as intended

[github-actions]

Hello, thank you for your contribution. If you are a participant, please close this pull request and open it in your own forked repository instead of here. Please read the instructions on your onboarding Assignment Submission Guide more carefully. If you are not a participant, please give us up to 72 hours to review your PR. Alternatively, you can reach out to us directly to expedite the review process.