{"id":20916834,"url":"https://github.com/raven-s-soul/data-structures-and-algorithms","last_synced_at":"2026-01-24T16:43:10.209Z","repository":{"id":206033574,"uuid":"715656798","full_name":"Raven-s-Soul/Data-Structures-and-Algorithms","owner":"Raven-s-Soul","description":"Quick notes for Trees, Hash, Graphs and Algorithms 2023/2024 at Roma 3","archived":false,"fork":false,"pushed_at":"2024-11-04T11:24:32.000Z","size":160,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-05-13T11:42:35.311Z","etag":null,"topics":["c","complexity","graphs","hash","hashtable","heap","queue","sorting-algorithms","stack","trees","university"],"latest_commit_sha":null,"homepage":"","language":null,"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/Raven-s-Soul.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-11-07T15:17:46.000Z","updated_at":"2024-11-04T11:24:36.000Z","dependencies_parsed_at":"2023-11-07T16:36:32.504Z","dependency_job_id":"449696d8-fef3-4bdc-aed7-6d5385dc3e8e","html_url":"https://github.com/Raven-s-Soul/Data-Structures-and-Algorithms","commit_stats":null,"previous_names":["raven-s-soul/data-structures-and-algorithms"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Raven-s-Soul/Data-Structures-and-Algorithms","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raven-s-Soul%2FData-Structures-and-Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raven-s-Soul%2FData-Structures-and-Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raven-s-Soul%2FData-Structures-and-Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raven-s-Soul%2FData-Structures-and-Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Raven-s-Soul","download_url":"https://codeload.github.com/Raven-s-Soul/Data-Structures-and-Algorithms/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Raven-s-Soul%2FData-Structures-and-Algorithms/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28731717,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-24T10:24:43.181Z","status":"ssl_error","status_checked_at":"2026-01-24T10:24:36.112Z","response_time":89,"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":["c","complexity","graphs","hash","hashtable","heap","queue","sorting-algorithms","stack","trees","university"],"created_at":"2024-11-18T16:26:19.304Z","updated_at":"2026-01-24T16:43:10.194Z","avatar_url":"https://github.com/Raven-s-Soul.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data-Structures-and-Algorithms [Roma3](https://www.uniroma3.it)\n\n - [English](./README.md)\n - [IT-Italiano](./[IT]README.md)\n\n## [Lists and Time Complexity](Lists/Lists.md)\n\u003e [!TIP]\n\u003e Is the base needed, a strong understanding, like after IT-Fundamentals:\n\u003e - [Random Access Machine](Lists/Lists.md#ram---random-access-machine)\n\u003e - [Pointers](Lists/Lists.md#Pointers)\n\u003e - [Struct/ADT](Lists/Lists.md#structs-or-adtabstract-data-type)\n\u003e - [Stack](Lists/Lists.md#pile-or-stack-)\n\u003e - [Queue](Lists/Lists.md#code-or-queue)\n\u003e - [Complexity](Lists/Lists.md#complexity)\n\n## [Trees](Trees/Trees.md)\n\u003e [!IMPORTANT]\n\u003e  Focus, they look the same but they aren't:  \n\u003e - [Binary](Trees/Trees.md#binary)\n\u003e - [Searching](Trees/Trees.md#searching)\n\u003e - [Arbitrary Grade](Trees/Trees.md#arbitrary-grade)\n\u003e - [Black\u0026Red](Trees/Trees.md#blackred)\n\u003e - [Priority Queue and Heap](Trees/Trees.md#priority-queue-and-heap)\n\n## [Hash](Hash/Hash.md)\n\u003e [!WARNING]\n\u003e It's mostly theory, so at least you should be able to understand what it is and how it works.\n\u003e - [Hash Table](Hash/Hash.md#hash-tables)\n\u003e - [Equal](Hash/Hash.md#equal-functions)\n\u003e - [Hash Function](Hash/Hash.md#hash-functions) (Hash functions for differents data type are not included)\n\u003e - [Solution to collisions](Hash/Hash.md#solution-to-collisions)\n\n## [Graphs](Graphs/Graphs.md)\n\u003e [!NOTE]\n\u003e The last step, you're so close!\n\u003e - [Lists](Graphs/Graphs.md#gaph-lists)\n\u003e - [Matrix](Graphs/Graphs.md#gaph-matrix)\n\u003e - [Objects](Graphs/Graphs.md#gaph-objects)\n\n## [Sorting Algorithms](SortingAlgorithms/SortingAlgorithms.md)\n\u003e [!CAUTION]\n\u003e They are just hard to remember. It's literally theory so ***Hold still!***\n\u003e - [Properties](SortingAlgorithms/SortingAlgorithms.md#greedy)\n\u003e - [Master Theorem](SortingAlgorithms/SortingAlgorithms.md#master-theorem)\n\u003e - [Selection sort](SortingAlgorithms/SortingAlgorithms.md#selection-sort)\n\u003e - [Insertion sort](SortingAlgorithms/SortingAlgorithms.md#insertion-sort)\n\u003e - [Merge Sort](SortingAlgorithms/SortingAlgorithms.md#merge-sort)\n\u003e - [Quick Sort](SortingAlgorithms/SortingAlgorithms.md#quick-sort)\n\u003e - [Heap Sort](SortingAlgorithms/SortingAlgorithms.md#heap-sort)\n\u003e - [Tree Sort](SortingAlgorithms/SortingAlgorithms.md#tree-sort)\n\u003e - [Linear sorts](SortingAlgorithms/SortingAlgorithms.md#counting-sort)\n\n## [Problems Complexity](ProblemsComplexity/ProblemsComplexity.md#problems-complexity)\n\u003e It's just ***\"Trivial Shit\"***.\n\n## We ***wish you luck*** for the exam! - **By every [contributors](Contributors/Contributors.md#contributors)**\n\u003e If you wanna do some improvements, \"***fork***\" the repository, do your edits, commit and push and then pull request.\n\u003e \n\u003e Remember to add yourself at the end of contributors file.\n\u003e \n\u003e If needed, feel free to email or contact.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraven-s-soul%2Fdata-structures-and-algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fraven-s-soul%2Fdata-structures-and-algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraven-s-soul%2Fdata-structures-and-algorithms/lists"}