{"id":19814106,"url":"https://github.com/guibrandt/mc202","last_synced_at":"2026-06-08T13:31:10.640Z","repository":{"id":129285828,"uuid":"355273364","full_name":"GuiBrandt/mc202","owner":"GuiBrandt","description":"Implementação dos laboratórios de MC202 no segundo semestre de 2020 na Unicamp","archived":false,"fork":false,"pushed_at":"2021-04-13T02:58:24.000Z","size":1807,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-28T19:12:08.875Z","etag":null,"topics":["data-structures","mc202","unicamp"],"latest_commit_sha":null,"homepage":"","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/GuiBrandt.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-04-06T17:21:44.000Z","updated_at":"2025-02-14T02:50:00.000Z","dependencies_parsed_at":"2023-07-16T06:01:13.833Z","dependency_job_id":null,"html_url":"https://github.com/GuiBrandt/mc202","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/GuiBrandt/mc202","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuiBrandt%2Fmc202","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuiBrandt%2Fmc202/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuiBrandt%2Fmc202/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuiBrandt%2Fmc202/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/GuiBrandt","download_url":"https://codeload.github.com/GuiBrandt/mc202/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/GuiBrandt%2Fmc202/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34065347,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-08T02:00:07.615Z","response_time":111,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["data-structures","mc202","unicamp"],"created_at":"2024-11-12T09:38:06.268Z","updated_at":"2026-06-08T13:31:10.596Z","avatar_url":"https://github.com/GuiBrandt.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# MC202\n\nImplementação dos laboratórios de MC202 no segundo semestre de 2020.\n\nA lista de tarefas e seus enunciados está disponível em\nhttps://www.ic.unicamp.br/~lehilton/mc202ab/tarefas/\n\n# Índice\n\n- [Tarefa 1](./tarefa01/README.md): Matriz densa\n- [Tarefa 2](./tarefa02/README.md): Array\n- [Tarefa 3](./tarefa03/README.md): Array, [algoritmo on-line de variância de Welford][welford]\n- [Tarefa 4](./tarefa04/README.md): Matriz densa, backtracking\n- [Tarefa 5](./tarefa05/README.md): Bignum (lista ligada) e operações, busca binária (divisão)\n- [Tarefa 6](./tarefa06/README.md): Deque\n- [Tarefa 7](./tarefa07/README.md): Árvore binária de busca simples\n- [Tarefa 8](./tarefa08/README.md): Árvore splay aumentada (multi-set)\n- [Tarefa 9](./tarefa09/README.md): Heap binário, [Burst Trie][burst-trie], originalmente usava um [Beap][beap]\n- [Tarefa 10](./tarefa10/README.md): Tabela de hashing, hash [FNV-1a][fnv-1a], [BK-tree][bk-tree], distância de levenshtein (DP)\n- [Tarefa 11](./tarefa11/README.md): Grafo completo (array dinâmico), Union-Find, algoritmo de Kruskal\n- [Tarefa 12](./tarefa12/README.md): Grafo (com \"ponteiros\"), detecção de ciclos (busca em profundidade), [analisador sintático descendente recursivo][recursive-descent]\n\n# Índice por ED\n\n## Array\n- Array: [Tarefa 2](./tarefa02/README.md), [Tarefa 3](./tarefa03/README.md)\n- Grafo completo (Array dinâmico): [Tarefa 11](./tarefa11/README.md)\n- Matriz densa: [Tarefa 1](./tarefa01/README.md), [Tarefa 4](./tarefa04/README.md)\n\n## Lista ligada\n- Bignum (com lista ligada): [Tarefa 5](./tarefa05/README.md)\n- Deque (com lista ligada): [Tarefa 6](./tarefa06/README.md)\n\n## Árvores\n- Árvore binária de busca simples: [Tarefa 7](./tarefa07/README.md)\n- Árvore Splay (multi-set, aumentada): [Tarefa 8](./tarefa08/README.md) (originalmente usava uma [multi-splay][msplay])\n- [BK-tree]: [Tarefa 10](./tarefa10/README.md)\n- [Burst Trie][burst-trie]: [Tarefa 9](./tarefa09/README.md)\n- Heap binário: [Tarefa 9](./tarefa09/README.md) (originalmente usava um [beap][beap])\n\n[msplay]: https://github.com/GuiBrandt/multi-splay\n[burst-trie]: http://www.lindstaedt.com.br/estruturas/bursttries.pdf\n[beap]: https://en.wikipedia.org/wiki/Beap\n[bk-tree]: https://en.wikipedia.org/wiki/BK-tree\n\n## Misc.\n- Grafo (com \"ponteiros\"): [Tarefa 12](./tarefa12/README.md)\n- Tabela de hashing: [Tarefa 10](./tarefa10/README.md)\n- [Union-Find][union-find]: [Tarefa 11](./tarefa11/README.md)\n\n[union-find]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure\n\n# Índice por Algoritmo\n\n- Algoritmo de Kruskal: [Tarefa 11](./tarefa11/README.md)\n- [Algoritmo on-line de variância de Welford][welford]: [Tarefa 3](./tarefa03/README.md)\n- [Analisador sintático descendente recursivo][recursive-descent]: [Tarefa 12](./tarefa12/README.md)\n- Backtracking: [Tarefa 4](./tarefa04/README.md)\n- Busca binária: [Tarefa 5](./tarefa05/README.md)\n- Detecção de ciclos (busca em profundidade): [Tarefa 12](./tarefa12/README.md)\n- Distância de Levenshtein (DP): [Tarefa 10](./tarefa10/README.md)\n- [Hash FNV-1a][fnv-1a]: [Tarefa 10](./tarefa10/README.md)\n\n[welford]: https://en.wikipedia.org/wiki/Algorithms_for_calculating_variance#Welford's_online_algorithm\n[fnv-1a]: http://isthe.com/chongo/tech/comp/fnv/#FNV-1a\n[recursive-descent]: https://en.wikipedia.org/wiki/Recursive_descent_parser\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fguibrandt%2Fmc202","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fguibrandt%2Fmc202","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fguibrandt%2Fmc202/lists"}