{"id":28795985,"url":"https://github.com/anacarolcs/fibonacciperformance","last_synced_at":"2025-08-17T19:35:26.857Z","repository":{"id":75420033,"uuid":"321210861","full_name":"AnaCarolcs/FibonacciPerformance","owner":"AnaCarolcs","description":"O projeto tem como objetivo aplicar a técnica de programação dinâmica para reduzir a complexidade da função de fibonacci recursiva de O(2^n), para O(n). Para isso, introduziremos resumidamente como funciona essa sequência.","archived":false,"fork":false,"pushed_at":"2020-12-14T02:40:42.000Z","size":589,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2023-08-06T16:39:01.605Z","etag":null,"topics":["complexity","dc","dinamic-programming","fibonacci","fibonacci-sequence"],"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/AnaCarolcs.png","metadata":{},"created_at":"2020-12-14T02:29:57.000Z","updated_at":"2023-08-06T16:39:01.605Z","dependencies_parsed_at":"2023-06-06T10:45:15.821Z","dependency_job_id":null,"html_url":"https://github.com/AnaCarolcs/FibonacciPerformance","commit_stats":null,"previous_names":[],"tags_count":0,"template":null,"template_full_name":null,"purl":"pkg:github/AnaCarolcs/FibonacciPerformance","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnaCarolcs%2FFibonacciPerformance","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnaCarolcs%2FFibonacciPerformance/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnaCarolcs%2FFibonacciPerformance/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnaCarolcs%2FFibonacciPerformance/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AnaCarolcs","download_url":"https://codeload.github.com/AnaCarolcs/FibonacciPerformance/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnaCarolcs%2FFibonacciPerformance/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260477932,"owners_count":23015066,"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":["complexity","dc","dinamic-programming","fibonacci","fibonacci-sequence"],"created_at":"2025-06-18T03:10:51.896Z","updated_at":"2025-06-18T03:11:51.470Z","avatar_url":"https://github.com/AnaCarolcs.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanacarolcs%2Ffibonacciperformance","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanacarolcs%2Ffibonacciperformance","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanacarolcs%2Ffibonacciperformance/lists"}