{"id":20840444,"url":"https://github.com/danielbatres/algorithmic-complexity-javascript","last_synced_at":"2026-04-25T01:39:17.886Z","repository":{"id":200628862,"uuid":"705947896","full_name":"danielbatres/algorithmic-complexity-javascript","owner":"danielbatres","description":"This project is aimed at learning about algorithmic complexity with JavaScript, to assess algorithms using Big O notation and considering both time complexity and space complexity.","archived":false,"fork":false,"pushed_at":"2023-10-18T17:22:58.000Z","size":8,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-12T10:13:01.777Z","etag":null,"topics":["algorithm-analysis","algorithms","big-o","big-o-notation","complexity","javascript","nodejs"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/danielbatres.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-10-17T02:34:13.000Z","updated_at":"2023-10-18T17:12:30.000Z","dependencies_parsed_at":"2023-11-17T05:00:25.204Z","dependency_job_id":"74305213-976e-461b-a26b-55e17c39c308","html_url":"https://github.com/danielbatres/algorithmic-complexity-javascript","commit_stats":{"total_commits":10,"total_committers":2,"mean_commits":5.0,"dds":0.09999999999999998,"last_synced_commit":"aa9bdc87557ece035a49ec1a8bc0b16002ec229b"},"previous_names":["danielbatres/algorithmic-complexity-javascript"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/danielbatres/algorithmic-complexity-javascript","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbatres%2Falgorithmic-complexity-javascript","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbatres%2Falgorithmic-complexity-javascript/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbatres%2Falgorithmic-complexity-javascript/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbatres%2Falgorithmic-complexity-javascript/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/danielbatres","download_url":"https://codeload.github.com/danielbatres/algorithmic-complexity-javascript/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/danielbatres%2Falgorithmic-complexity-javascript/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32247508,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-24T13:21:15.438Z","status":"ssl_error","status_checked_at":"2026-04-24T13:21:15.005Z","response_time":64,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["algorithm-analysis","algorithms","big-o","big-o-notation","complexity","javascript","nodejs"],"created_at":"2024-11-18T01:16:25.175Z","updated_at":"2026-04-25T01:39:17.860Z","avatar_url":"https://github.com/danielbatres.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithmic complexity with JavaScript and Big O notation\r\n\r\n## Algorithmic Complexity Evaluation with JavaScript\r\n\r\nThis project focuses on the evaluation of time and space complexity of algorithms using Big O notation, and employs a concise and simplified evaluation approach.\r\n\r\n### Evaluation Methods\r\n\r\nJavaScript is used to perform the evaluations, making use of the following functions:\r\n- `console.time()`\r\n- `console.timeEnd()`\r\n- `performance.now()`\r\n\r\nThese functions assist in measuring the execution time of algorithms. It's important to note that the data obtained may not be entirely precise, but they offer a practical way to estimate algorithm performance.\r\n\r\n\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielbatres%2Falgorithmic-complexity-javascript","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdanielbatres%2Falgorithmic-complexity-javascript","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdanielbatres%2Falgorithmic-complexity-javascript/lists"}