https://github.com/artembotnev/algorithms-and-data-structures

Examples of algorithms and data structures
https://github.com/artembotnev/algorithms-and-data-structures

algorithms graphs hash-tables heaps sorting-algorithms stacks trees

Last synced: 9 months ago
JSON representation

Examples of algorithms and data structures

• Host: GitHub
• URL: https://github.com/artembotnev/algorithms-and-data-structures
• Owner: ArtemBotnev
• License: mit
• Created: 2018-06-09T17:52:04.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2019-08-05T19:53:38.000Z (almost 7 years ago)
• Last Synced: 2025-10-08T05:03:36.482Z (9 months ago)
• Topics: algorithms, graphs, hash-tables, heaps, sorting-algorithms, stacks, trees
• Language: Kotlin
• Homepage:
• Size: 76.2 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Algorithms and Data Structures

## Packages:

### Sorting algorithms

* Simple algorithms

    * Bubble sort

    * Selection sort

    * Insert sort

* Advanced algorithms

    * Quick sort

    * Merge sort

    * Shell sort

### Stacks and Queues

* Stack example "string revers"

* Queue example with integer data

* Brackets checker example (using stack)

### Linked lists

* Bind linked list

* Linked stack

    * Stack example "string revers" with LinkedStack

* Cyclic linked list    

    * Solution of Josephus Flavius task by CyclicList

### Recursion

* Example "anagrams"  

### Trees

* Binary tree

    * put function

    * get function   

    * delete function 

    * function visualization tree as string

    * example of using  

* 2-3-4 tree

    * put function

    * get function 

    * example of using

### Hash tables

* Open addressing hash tables

    * Linear hash table  

    * Double hash table 

* Chain hash table 

* examples of using

### Heaps

* Heap as implementation of priority queue

* Extensions of heap for sorting

* examples of using

### Graphs

* Ordinary graphs

    * Undirected graphs

        * Depth first search

        * Breadth first search

        * Minimum spanning tree

        * example of using

    * Directed graphs

        * Topological sorting

        * example of using

* Weighted graphs

    * Undirected graphs

         * Minimum spanning tree

         * example of using

    * Directed graphs

         * Search of the shortest path

         * example of using