Link Search Menu Expand Document

Data Structures and Algorithms

logo

  • [ language-specific data structures ]
  • [ Linear Data Structures ]
    • Lists
    • Sets
    • Tuples
    • Stacks
  • [ Non-Linear Data Structures]
    • Trees
    • Tables
    • Containers
    • Hash functions
  • [ Homogeneous Data Structures ]
    • Two-dimensional arrays
    • Multi-dimensional arrays
      • Matrix representation
      • Multiplication
      • Addition
      • Subtraction
      • Determinant calculation
      • Inversion
      • Transposition
  • [ Heterogeneous Data Structures ]
    • Linked lists
    • Ordered lists
    • Unordered lists
  • [ Dynamic Data Structures ]
    • Dictionaries
    • TreeSets:
      • Synchronized TreeSets
      • Mutable TreeSets Sequences:
      • Farey
      • Fibonacci
      • Look-and-say
      • Thue–Morse
  • [ Classic Algorithms ]
    • Sorting: - Bubble - Selection - Insertion - Shell - Merge - Quick
    • Searching:
      • Linear
      • Sequential
      • Binary
      • Interpolation
    • Recursion
    • Hashing
  • [ Network and Sparse Matrix Representation ]

    • Network representations using graphs:
      • Social network representation
      • Map layouts
      • Knowledge graphs
  • Sparse matrix representation using a list of

-[ Memory Management ]

  • Garbage collection
  • Cache management
  • Space allocation
  • Concepts—Go memory management