{"id":25961651,"url":"https://github.com/iamjuniorb/data_structures_and_algorithms","last_synced_at":"2025-12-02T10:02:17.189Z","repository":{"id":269245711,"uuid":"906843966","full_name":"IAmJuniorB/Data_Structures_and_Algorithms","owner":"IAmJuniorB","description":"I'm working on Data Structures and Algorithms I C949 class in school and decided to write up all of these searching algorithms, sorting algorithms, strutures, and so on to get a better understanding. These can be used with large datasets to test their space and time complexities.","archived":false,"fork":false,"pushed_at":"2024-12-22T04:30:25.000Z","size":0,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-22T05:24:00.346Z","etag":null,"topics":["data","data-analysis","data-science","data-structures","datastructures","datastructures-algorithms","datastructuresandalgorithm","math","mathematics","programming","python","python-app","python-library","python3"],"latest_commit_sha":null,"homepage":"","language":"Python","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/IAmJuniorB.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":"2024-12-22T04:28:38.000Z","updated_at":"2024-12-22T04:32:40.000Z","dependencies_parsed_at":"2024-12-22T05:24:11.165Z","dependency_job_id":"30a612ce-3ad8-4051-8fb1-e8a9738997f2","html_url":"https://github.com/IAmJuniorB/Data_Structures_and_Algorithms","commit_stats":null,"previous_names":["iamjuniorb/data_structures_and_algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IAmJuniorB%2FData_Structures_and_Algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IAmJuniorB%2FData_Structures_and_Algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IAmJuniorB%2FData_Structures_and_Algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/IAmJuniorB%2FData_Structures_and_Algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/IAmJuniorB","download_url":"https://codeload.github.com/IAmJuniorB/Data_Structures_and_Algorithms/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241912936,"owners_count":20041457,"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":["data","data-analysis","data-science","data-structures","datastructures","datastructures-algorithms","datastructuresandalgorithm","math","mathematics","programming","python","python-app","python-library","python3"],"created_at":"2025-03-04T19:40:44.733Z","updated_at":"2025-12-02T10:02:17.182Z","avatar_url":"https://github.com/IAmJuniorB.png","language":"Python","readme":"## Data Structures and Algorithms in Python\r\n\r\n#### This repository contains implementations of various data structures and algorithms in Python. The code is organized into four main categories: Data Structures, Search Algorithms, Sorting Algorithms, and Graph Algorithms.\r\n\r\n## Structure\r\n```\r\nROOT\r\n│\r\n├── DATA STRUCTURES\r\n│   ├── arrays.py\r\n│   ├── avl_tree.py\r\n│   ├── binary_search_tree.py\r\n│   ├── b_tree.py\r\n│   ├── binary_heap.py\r\n│   ├── cartesian_tree.py\r\n│   ├── doubly_linked_list.py\r\n│   ├── fibonacci_heap.py\r\n│   ├── hash_tables.py\r\n│   ├── kd_tree.py\r\n│   ├── priority_queue.py\r\n│   ├── queue.py\r\n│   ├── red_black_tree.py\r\n│   ├── singly_linked_list.py\r\n│   ├── skip_list.py\r\n│   ├── stack.py\r\n│   └── trie.py\r\n│\r\n├── SEARCH ALGORITHMS\r\n│   ├── a_star_search.py\r\n│   ├── binary_search.py\r\n│   ├── boyer_moore_string_search.py\r\n│   ├── breadth_first_search.py\r\n│   ├── depth_first_search.py\r\n│   ├── fibonacci_search.py\r\n│   ├── floyd_cycle_detection.py\r\n│   ├── interpolation_search.py\r\n│   ├── jump_search.py\r\n│   ├── knuth_morris_pratt_search.py\r\n│   ├── linear_search.py\r\n│   ├── manacher_algorithm.py\r\n│   ├── rabin_karp_search.py\r\n│   ├── recursive_binary_search.py\r\n│   ├── suffix_array_search.py\r\n│   ├── ternary_search.py\r\n│   └── z_algorithm.py\r\n│\r\n├── SORTING ALGORITHMS\r\n│   ├── bogo_sort.py\r\n│   ├── bubble_sort.py\r\n│   ├── bucket_sort.py\r\n│   ├── cocktail_sort.py\r\n│   ├── comb_sort.py\r\n│   ├── counting_sort.py\r\n│   ├── cube_sort.py\r\n│   ├── heap_sort.py\r\n│   ├── insertion_sort.py\r\n│   ├── linked_list_merge_sort.py\r\n│   ├── merge_sort.py\r\n│   ├── quicksort.py\r\n│   ├── radix_sort.py\r\n│   ├── selection_sort.py\r\n│   ├── shell_sort.py\r\n│   ├── timsort.py\r\n│   └── tree_sort.py\r\n│\r\n├── GRAPH ALGORITHMS\r\n│   ├── articulation_points.py\r\n│   ├── bellman_ford_algorithm.py\r\n│   ├── dijkstra's_algorithm.py\r\n│   ├── edmonds-karp_algorithm.py\r\n│   ├── floyd_warshall_algorithm.py\r\n│   ├── kosaraju's_algorithm.py\r\n│   ├── kruskal's_algorithm.py\r\n│   ├── maximum_bipartite_matching.py\r\n│   ├── prim's_algorithm.py\r\n│   └── topological_sort.py\r\n│\r\n├── Dynamic Programming\r\n│   ├── coin_change.py\r\n│   ├── edit_distance.py\r\n│   ├── fibonacci_sequence.py\r\n│   ├── knapsack_01.py\r\n│   ├── longest_common_subsequence.py\r\n│   ├── maximum_subarrray.py\r\n│\r\n└── UTILITIES\r\n    ├── load.py\r\n    └── recursion.py\r\n```\r\n\r\n## Usage\r\n\r\nI'm personally using it to better understand data structures and algorithms. Will probably use large datasets to compare and contrast.\r\n\r\nFeel free to contribute by adding new algorithms or fixing any mistakes I have made. Please ensure that your code follows the existing structure and includes appropriate documentation and test cases. If you can't tell, I LOVE documentation.\r\n\r\n\r\n## License\r\n\r\nThis project is open source and available under the MIT License.\r\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiamjuniorb%2Fdata_structures_and_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fiamjuniorb%2Fdata_structures_and_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiamjuniorb%2Fdata_structures_and_algorithms/lists"}