{"id":16653159,"url":"https://github.com/anuraganalog/dfs","last_synced_at":"2025-04-09T18:04:54.516Z","repository":{"id":55394430,"uuid":"171012370","full_name":"AnuragAnalog/dfs","owner":"AnuragAnalog","description":"Data and File structues","archived":false,"fork":false,"pushed_at":"2021-10-27T06:21:11.000Z","size":96,"stargazers_count":4,"open_issues_count":1,"forks_count":7,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-23T20:03:44.645Z","etag":null,"topics":["algorithms","c","data-structures","dfs","hacktoberfest","hacktoberfest2020","hashing","linked-list","py3","queue","searching","shuffling","sort","sorting","stack","tree"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AnuragAnalog.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}},"created_at":"2019-02-16T14:25:37.000Z","updated_at":"2023-02-01T23:04:03.000Z","dependencies_parsed_at":"2022-08-14T23:20:23.310Z","dependency_job_id":null,"html_url":"https://github.com/AnuragAnalog/dfs","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/AnuragAnalog%2Fdfs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnuragAnalog%2Fdfs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnuragAnalog%2Fdfs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AnuragAnalog%2Fdfs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AnuragAnalog","download_url":"https://codeload.github.com/AnuragAnalog/dfs/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248084267,"owners_count":21045123,"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":["algorithms","c","data-structures","dfs","hacktoberfest","hacktoberfest2020","hashing","linked-list","py3","queue","searching","shuffling","sort","sorting","stack","tree"],"created_at":"2024-10-12T09:43:24.585Z","updated_at":"2025-04-09T18:04:54.476Z","avatar_url":"https://github.com/AnuragAnalog.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Data and File structures\n\nThis repository contains some algorithms of Data and File structures(DFS),\n\n## Searching Algorithms\n* Linear search\n* Binary search\n\n## Sorting Algorithms\n\n* Bubble sort\n* Selection sort\n* Insertion sort\n* Merge sort\n* Quick sort\n* Odd-Even sort\n* Counting sort (stable \u0026 unstable)\n* Radix sort\n* Bucket sort (Bin sort)\n\n## Data Structures\n\n* Linear DS\n\n   * Stack\n      * Stack (Array Implementation)\n      * Linked Stack (Linked List Implementation)\n      * Stack (Queue Implementation)\n      * Applications\n         * Reversing of a string\n         * Checking a palindrome\n         * Parenthesis Checking\n         * Infix to Postfix expression\n         * Infix to Prefix expression\n         * Evaluation of Postfix expression\n         * Evaluation of Prefix expression\n\n   * Queue\n      * Queue (Array and Linked list Implementation)\n      * Circular Queue (Array and Linked list Implementation)\n      * Double ended Queue (Linked list Implementation)\n      * Queue (Stack Implementation)\n      * Operations\n        * Queue copy reverse\n        * Queue Search\n\n   * Linked List\n      * Singlely Linked List\n      * Circular Singlely Linked List\n      * Doublely Linked List\n      * Circular Doublely Linked List\n      * Operations\n        * Reverse the list\n        * Delete Duplicates from sorted list\n        * Delete Duplicates from un-sorted list\n        * Delete the maximum element from list\n        * Find the middle element in list\n        * Find the middle element in list(v2)\n        * Sort the list\n\n   * Hashing\n      * Separate chaining\n      * Open Addressing (Linear \u0026 Quadratic)\n\n* Non-Linear DS\n   * Trees\n      * Binary search Tree(BST)\n      * Binary Heap(Max)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanuraganalog%2Fdfs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanuraganalog%2Fdfs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanuraganalog%2Fdfs/lists"}