algorithms_and_data_structures_a_to_z

Algorithms and Datastructures course implementation in Go

WARNING: All the code for data structures and algorithms in this repository are strictly for educational purposes, this code cannot be used anywhere!

NOTE: Code has no comments or explanations. Please refer to the course (see the link below) for details.

NOTE: Code in this repo is not Go-style code at all. All the implementations, naming conventions and method names are inherited from the course which is about C# basically.

Link to the Udemy course: https://www.udemy.com/course/algodata/

Course sections and corresponding algorithm/data structure implementations

Section 5: Sorting algorithms

• Bubble sort
• Selection sort
• Insertion sort
• Shell's sort
• Merge sort
• Quick sort

Section 6: Linked lists

• Singly linked list
• Doubly linked list

Section 7: Stack

• Stack on linked list
• Stack on array

Section 8: Queue

• Dummy queue on array
• Ring queue
• Queue on linked list

Section 9: Search algorithms

• Binary search (iterative approach)
• Binary search (recursive approach)

Section 10: Symbol Tables

• Linear search symbol table
• Binary search symbol table

Section 11: Hashed Symbol Tables (Hash Tables)

• Chain hash map
• Linear probe hash map

Section 12: Binary Search Tree

• Binary Search Tree

Section 13: Pyramids and Pyramid Sort (Heap and Heap Sort)

• Max Heap

Section 14: Different algorithms

• Sieve of Eratosthenes