Data Structure and Algorithms
CtrlK
HomeGitHubBlogs
  • 🧮Data Structure and Algorithms
  • 🌸Welcome!
  • 📚Standard Template Library
  • 🍽️Prerequisites
  • 🌏Structures
    • Intro
    • Preliminaries (basics)
    • String Processing
    • Array and matrix
    • Linked List
    • Stack & Queue
      • Stack Basics
      • Postfix notation
      • Quick Sort
      • Recursion
      • Tower of Hanoi
      • Queue
      • Priority Queue (one way list)
      • Priority Queue (2D matrix)
    • Tree
      • Binary Tree
      • Binary Search Tree
      • Heap and Heap Sort
      • Minimum Spanning Tree
    • Graph
      • 🔸Warshall's Algorithm
      • Linked Representation
      • Traversing - BFS, DFS & More
      • Dijkstra
      • Bellman-Ford
    • Sorting & Searching
      • Insertion Sort
      • Selection Sort
      • Bubble Sort
      • Merge Sort
  • 📚Math
    • Intro
    • Number Theory
    • Prime Numbers
    • GCD and LCM
    • Modular Arithmetic
    • Combinatorics
    • Probability
    • Big Integer
Powered by GitBook
On this page

Was this helpful?

Edit on GitHub

🍽️Prerequisites

There are some things, which may need for future understandings. Let me list some of 'em here.

Recursion

  • https://www.geeksforgeeks.org/pointers-vs-references-cpp/

  • https://www.geeksforgeeks.org/passing-reference-to-a-pointer-in-c/

PreviousStandard Template LibraryNextIntro

Last updated 1 year ago

Was this helpful?