https://github.com/anuraganalog/dfs

Data and File structues
https://github.com/anuraganalog/dfs

algorithms c data-structures dfs hacktoberfest hacktoberfest2020 hashing linked-list py3 queue searching shuffling sort sorting stack tree

Last synced: 15 days ago
JSON representation

Data and File structues

• Host: GitHub
• URL: https://github.com/anuraganalog/dfs
• Owner: AnuragAnalog
• License: gpl-3.0
• Created: 2019-02-16T14:25:37.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2021-10-27T06:21:11.000Z (about 3 years ago)
• Last Synced: 2024-12-07T09:10:28.137Z (29 days ago)
• Topics: algorithms, c, data-structures, dfs, hacktoberfest, hacktoberfest2020, hashing, linked-list, py3, queue, searching, shuffling, sort, sorting, stack, tree
• Language: C
• Homepage:
• Size: 93.8 KB
• Stars: 4
• Watchers: 2
• Forks: 7
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Data and File structures

This repository contains some algorithms of Data and File structures(DFS),

## Searching Algorithms

* Linear search

* Binary search

## Sorting Algorithms

* Bubble sort

* Selection sort

* Insertion sort

* Merge sort

* Quick sort

* Odd-Even sort

* Counting sort (stable & unstable)

* Radix sort

* Bucket sort (Bin sort)

## Data Structures

* Linear DS

   * Stack

      * Stack (Array Implementation)

      * Linked Stack (Linked List Implementation)

      * Stack (Queue Implementation)

      * Applications

         * Reversing of a string

         * Checking a palindrome

         * Parenthesis Checking

         * Infix to Postfix expression

         * Infix to Prefix expression

         * Evaluation of Postfix expression

         * Evaluation of Prefix expression

   * Queue

      * Queue (Array and Linked list Implementation)

      * Circular Queue (Array and Linked list Implementation)

      * Double ended Queue (Linked list Implementation)

      * Queue (Stack Implementation)

      * Operations

        * Queue copy reverse

        * Queue Search

   * Linked List

      * Singlely Linked List

      * Circular Singlely Linked List

      * Doublely Linked List

      * Circular Doublely Linked List

      * Operations

        * Reverse the list

        * Delete Duplicates from sorted list

        * Delete Duplicates from un-sorted list

        * Delete the maximum element from list

        * Find the middle element in list

        * Find the middle element in list(v2)

        * Sort the list

   * Hashing

      * Separate chaining

      * Open Addressing (Linear & Quadratic)

* Non-Linear DS

   * Trees

      * Binary search Tree(BST)

      * Binary Heap(Max)