{"id":15047956,"url":"https://github.com/abraaohonorio/algorithms-data-structures","last_synced_at":"2025-04-10T01:10:43.408Z","repository":{"id":52770176,"uuid":"82353655","full_name":"AbraaoHonorio/Algorithms-Data-Structures","owner":"AbraaoHonorio","description":"Implementations of Fundamental Algorithms \u0026 Data Structures in C++.","archived":false,"fork":false,"pushed_at":"2020-10-04T00:14:44.000Z","size":99,"stargazers_count":11,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-10T01:10:36.938Z","etag":null,"topics":["a-dynamic-programming","alogrithms","analysis","cplusplus-11","cpp","dijkstra","greedy-programming","heuristic-search-algorithms","insertion-sort","knapsack-problem","minimum-spanning-tree","prim","radix-sort","sort","sorting-algorithms","travelling-salesman-problem"],"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/AbraaoHonorio.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":"2017-02-18T01:53:55.000Z","updated_at":"2025-03-11T09:21:01.000Z","dependencies_parsed_at":"2022-08-22T21:21:15.452Z","dependency_job_id":null,"html_url":"https://github.com/AbraaoHonorio/Algorithms-Data-Structures","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbraaoHonorio%2FAlgorithms-Data-Structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbraaoHonorio%2FAlgorithms-Data-Structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbraaoHonorio%2FAlgorithms-Data-Structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AbraaoHonorio%2FAlgorithms-Data-Structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AbraaoHonorio","download_url":"https://codeload.github.com/AbraaoHonorio/Algorithms-Data-Structures/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248137886,"owners_count":21053775,"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":["a-dynamic-programming","alogrithms","analysis","cplusplus-11","cpp","dijkstra","greedy-programming","heuristic-search-algorithms","insertion-sort","knapsack-problem","minimum-spanning-tree","prim","radix-sort","sort","sorting-algorithms","travelling-salesman-problem"],"created_at":"2024-09-24T21:06:13.678Z","updated_at":"2025-04-10T01:10:43.389Z","avatar_url":"https://github.com/AbraaoHonorio.png","language":"C++","readme":"# Works of Design and Analysis of Algorithms:\r\n\r\n### Sort Order 01\r\nImplementation of sort algorithms:\r\n  - 1. Selection sort\r\n  - 2. Insertion sort\r\n  - 3. Merge sort\r\n  - 4. Quicksort\r\n  - 5. Heap Sort\r\n  \r\n  \r\n\r\n### Building for source Sort Order 01\r\n  ```sh\r\n  make all\r\n   ```\r\n  ```sh\r\n   ./apa-first_job \u003cmethod_number\u003e \u003c \u003cinput_file_name\u003e\r\n  ```\r\n  \r\n  \r\n### Sort Order 02\r\n  Given the implementations of work ordering 01 and the input sets provided for this exercise:\r\n\r\nSelect a colleague who has implemented sorting algorithms using a different programming language than yours.\r\nFor each input subset, run all algorithms and calculate the average time each algorithm spends for each size present in the subset.\r\n  \r\n  The Javascript code can be found in the following git repository: [clique aqui](https://github.com/bezerrathm/Design-And-Analysis-Of-Computer-Algorithms/)\r\n\r\n\r\nThe code in C ++ can be found in the following git repository: [clique aqui](https://github.com/AbraaoHonorio/Design-and-Analysis-of-Algorithms/tree/master/Sorting%2001)\r\n  \r\n  \r\n  \r\n### Building for source Sort Order 02\r\n  ```sh\r\n  make all\r\n   ```\r\n  ```sh\r\n   scriptBuildAll.sh\r\n  ```\r\n  \r\n### Sort Order 03\r\nImplementation of sort algorithms:\r\n  - 6. Counting sort \r\n  - 7. Bucket sort\r\n  - 8. Radix sort\r\n \r\n  \r\n\r\n### Building for source Sort Order  03\r\n  ```sh\r\n  make all\r\n   ```\r\n  ```sh\r\n   ./apa-first_job \u003cmethod_number\u003e \u003c \u003cinput_file_name\u003e\r\n  ```\r\n\r\n\r\n### Selector heuristic\r\n\r\nVerify that the input contains non-numeric characters\r\n  - If yes apply Radix Sort\r\nMake sure the input size is larger than the free main memory\r\n  - If yes, apply Merge Sort\r\nMake sure the input size is less than 22\r\n  - If yes apply Insertion Sort\r\nFor any other case\r\n  - Apply Quick Sort\r\n\r\n### Building for source Selector heuristic\r\n\r\n\r\n  ```sh\r\n  make all\r\n   ```\r\n  ```sh\r\n   ./apa-first_job \u003c \u003cinput_file_name\u003e\r\n  ```\r\n  \r\n  \r\n### A Dynamic Programming based solution for 0-1 Knapsack problem\r\n\r\n### Input file:\r\n    n M\r\n    pi\r\n    vi\r\n\r\n    subtitle:\r\n    n: |O|\r\n    M : Backpack capacity\r\n    pi : Vector of object weights\r\n    vi : Vector of object values\r\n    . E.g.:\r\n\r\n    4 30\r\n    13 23 17 19\r\n    23 29 27 25\r\n\r\n### Building for source knapsack problem\r\n \r\n ```sh\r\n  make all\r\n   ```\r\n  ```sh\r\n   ./apa-mochila \u003c mochila01.txt \r\n  ```\r\n ### Credits knapsack problem\r\n Developers: \r\n   - Abraão Állysson dos Santos Honório \r\n   - Thiago Henrique Menêses Bezerra [GitHub](https://github.com/bezerrathm)\r\n\r\n\r\n\r\n\r\n\r\n\r\n### Minimum spanning tree\r\n\r\nThe greedy solution of PRIM to the Problem of the Minimum Scattering Tree\r\n\r\n### Input file:\r\n    n \r\n    𝑤𝑖𝑗\r\n\r\n    subtitle:\r\n    n: |V|\r\n    𝑤𝑖𝑗 : Edge weights function (Adjacency Matrix)\r\n    . E.g.:\r\n\r\n    4\r\n    0 23 17 19\r\n    14 0 22 20\r\n    23 15 0 25\r\n    13 19 21 0\r\n\r\n### Building for source Minimum spanning tree\r\n \r\n ```sh\r\n  make all\r\n   ```\r\n  ```sh\r\n   ./apa-PRIM \u003c dij10.txt \r\n  ```\r\n  \r\n  \r\n### Dijkstra\r\n\r\n Dijkstra's greedy solution to the Minimum Path problem. Consider for all instances the origin vertex 𝑢 = 0 and 𝑣 = 𝑛-1\r\n\r\n### Input file:\r\n    n \r\n    𝑤𝑖𝑗\r\n\r\n    subtitle:\r\n    n: |V|\r\n    𝑤𝑖𝑗 : Edge weights function \r\n    . E.g.:\r\n\r\n    4\r\n    0 23 17 19\r\n    14 0 22 20\r\n    23 15 0 25\r\n    13 19 21 0\r\n\r\n### Building for source Dijkstra\r\n \r\n ```sh\r\n  make all\r\n   ```\r\n  ```sh\r\n   ./apa-Dijkstra \u003c dij10.txt \r\n  ```\r\n  \r\n  \r\n  \r\n  \r\n ### Credits Minimum spanning tree problem and Dijkstra\r\n Developers: \r\n   - Abraão Állysson dos Santos Honório \r\n   - Thiago Henrique Menêses Bezerra [GitHub](https://github.com/bezerrathm)\r\n\r\n\r\n  \r\n### Have a question or suggestion?\t\t\t\r\nPS: This repository is intended for the works of the discipline of analysis and algorithm projects of the Federal University of Paraiba  - UFPB\r\n\r\nContact me on [Linkedin](https://br.linkedin.com/in/abraaohonorio), send an email to abraaohonoriopb@gmail.com, or create a pull request in this project. \r\n\r\n---\r\n  \r\n  \r\n  License\r\n----\r\nMIT\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabraaohonorio%2Falgorithms-data-structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fabraaohonorio%2Falgorithms-data-structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fabraaohonorio%2Falgorithms-data-structures/lists"}