{"id":17949847,"url":"https://github.com/bblanchon/timecomplexitylimits","last_synced_at":"2025-07-14T09:42:28.199Z","repository":{"id":16654951,"uuid":"19410416","full_name":"bblanchon/TimeComplexityLimits","owner":"bblanchon","description":"Time-complexity benchmarks in C#","archived":false,"fork":false,"pushed_at":"2014-05-03T19:21:18.000Z","size":112,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-03T15:48:16.859Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C#","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/bblanchon.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":"2014-05-03T19:21:00.000Z","updated_at":"2014-05-03T19:21:20.000Z","dependencies_parsed_at":"2022-09-06T10:41:19.283Z","dependency_job_id":null,"html_url":"https://github.com/bblanchon/TimeComplexityLimits","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/bblanchon/TimeComplexityLimits","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblanchon%2FTimeComplexityLimits","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblanchon%2FTimeComplexityLimits/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblanchon%2FTimeComplexityLimits/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblanchon%2FTimeComplexityLimits/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bblanchon","download_url":"https://codeload.github.com/bblanchon/TimeComplexityLimits/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bblanchon%2FTimeComplexityLimits/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265272233,"owners_count":23738424,"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":[],"created_at":"2024-10-29T09:34:59.390Z","updated_at":"2025-07-14T09:42:28.162Z","avatar_url":"https://github.com/bblanchon.png","language":"C#","readme":"Time-complexity benchmarks in C#\n================================\n\nA very small project to see what is the maximum problem size depending on the problem complexity.\n\n### The results\n\nHere is what my Core i5-2500 can do in 5 seconds:\n\n| Time complexity | Maximum N |\n| --------------- | --------- |\n| O(1)            | Infinity  |\n| O(log(n))       | Infinity  |\n| O(n)            | 10^9      |\n| O(n log(n))     | 10^8      |\n| O(n^2)          | 10^4      |\n| O(n^3)          | 10^3      |\n| O(2^n)          | 30        |\n| O(n!)           | 10        |\n\n### Why ?\n\nI needed that for my [Google Code Jam Cheat Sheet](http://blog.benoitblanchon.fr/google-code-jam-cheat-sheet/)\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbblanchon%2Ftimecomplexitylimits","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbblanchon%2Ftimecomplexitylimits","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbblanchon%2Ftimecomplexitylimits/lists"}