{"id":22585576,"url":"https://github.com/espiramarvin/dsa-practices","last_synced_at":"2025-03-28T17:18:26.627Z","repository":{"id":55341300,"uuid":"498608132","full_name":"EspiraMarvin/dsa-practices","owner":"EspiraMarvin","description":"DSA Practices ","archived":false,"fork":false,"pushed_at":"2023-11-28T07:02:01.000Z","size":2100,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-02-02T17:52:23.908Z","etag":null,"topics":["algorithms","data-structures"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/EspiraMarvin.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-06-01T05:53:10.000Z","updated_at":"2023-03-07T03:12:57.000Z","dependencies_parsed_at":"2023-02-18T03:55:21.365Z","dependency_job_id":null,"html_url":"https://github.com/EspiraMarvin/dsa-practices","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EspiraMarvin%2Fdsa-practices","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EspiraMarvin%2Fdsa-practices/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EspiraMarvin%2Fdsa-practices/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EspiraMarvin%2Fdsa-practices/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/EspiraMarvin","download_url":"https://codeload.github.com/EspiraMarvin/dsa-practices/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246068308,"owners_count":20718503,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","data-structures"],"created_at":"2024-12-08T07:08:59.345Z","updated_at":"2025-03-28T17:18:26.602Z","avatar_url":"https://github.com/EspiraMarvin.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"#### DS \u0026 A\n### BIG-O TIME COMPLEXITY \n\n#### 1. Linear time complexity      - O(n) worst case time complexity/time complexity\n#### 2. Constant time complexity    - O(1)\n#### 3. Quadratic time complexity   - O(n^2)\n#### 4. Cubic time complexity       - O(n^3)\n#### 5. Logarithmic time complexity - O(logn) - input size reduced by half - O(logn)\n\n\u003cbr /\u003e\n\n##### BIG-O GUIDE\n\n###### 1. loop - O(n)\n###### 2. nested loop -O(n^2)\n###### 3. Logarithmic O(log n) input size reduced by half\n\n\u003cbr /\u003e\n\n### BIG-O SPACE COMPLEXITY\n\n#### 1. Constant - O(1) -no extra space/memory needed when input size increases\n#### 2. Linear   - O(n) - extra space neede when input size increases\n#### 3. Logarithmic -O(log n) - extra space needed grows but not at the same rate as the input size\n#### 4. Quadratic - you should try to avoid","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fespiramarvin%2Fdsa-practices","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fespiramarvin%2Fdsa-practices","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fespiramarvin%2Fdsa-practices/lists"}