Skip to content

📚 A study about of data structures, algorithms and run time complexity.

Notifications You must be signed in to change notification settings

jeffersondanielss/datastructures-algorithms

Repository files navigation

Data Structures and Algorithms

Data Structures

  • Stack
  • Queue
  • Set
  • Dictionary
  • Hash Table
  • Hash Table Linar Probing
  • Linked List
  • Doubly Linked List
  • Circular Linked List
  • Binary Search Tree
  • Trie
  • Graph

Algorithms

  • Circular
  • fibonacci
  • fromlast
  • mindpoint
  • Buble Sort
  • Insertion Sort
  • Merge Sort
  • Selection Sort
  • Quick Sort

Asymptotic analysis

Big O Notation

Big O notation is a mathematical notation that describes the limiting behaviour of a function when the argument tends towards a particular value or infinity.

Links

Courses

Books

Articles

About

📚 A study about of data structures, algorithms and run time complexity.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages