marcosfede/algorithms

Write time complexity for each solution implemented so far

Open

#9 opened on Mar 26, 2018

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Python (1,125 stars) (187 forks)batch import
good first issuehelp wanted

Description

Each solution should have a comment stating the time (and maybe the space) complexity of the solution

Contributor guide

Tech stack
python
Domain
documentation
Issue type
documentation
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
stale
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
clear
Prerequisites
None
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
75
Research direction
Review all solution files in the repository to identify which algorithms have been implemented. For each implementation, analyze the algorithm and add a comment stating its time complexity (and optionally space complexity) in Big O notation. Follow any existing comment conventions in the codebase. If the repository uses multiple languages, ensure comments are added consistently across all files. No linked PRs or comments provide further guidance.
Write time complexity for each solution implemented so far · marcosfede/algorithms#9 | Good First Issue