Algorithmics 25
Search
Search
Dark mode
Light mode
Explorer
Python
NetworkX Cheatsheet
NetworkX Edges
NetworkX Nodes
Python Concepts
Unit 3
Abstract data types
Types
Array
Dictionary
List
Priority queue
Queue
Set
Stack
Abstract data type
Abstract data type signature
Combination ADTs
Data type
Non-primitive data type
Primitive data type
Algorithm design
Communication of Algorithms
Communication of Algorithms
Correctness
other proof examples
contradiction
DAG source
Pigeon hole principle
Correctness
Proof
Design types
Algorithm design
Modular design
Algorithm
Algorithm Types
Algorithm types
Function
PrecomputationProcrastination
Pseudocode
State diagram
Algorithm Implementations
Graph-related algorithms
Path finding
path finding
Shortest path
Bellman-Ford algorithm
Dijkstra's algorithm
Floyd-Warshall algorithm
Warshall's Transitive Closure Algorithm
Traversal
Best-first search
Breadth-first search
Breadth-first search (graphs)
Breadth-first search (trees)
Comparison between traversal algorithms
Depth-first search
Tree
Prim's Algorithm
Comparing Graph Algorithms
PageRank
Sorting Algorithms
Merge sort
Quick sort
Boolean algebra
Boolean Algebra
Boolean algebra
Conjunction (boolean algebra)
Disjunction (boolean algebra)
Logic statement
Negation (boolean algebra)
Properties of Equivalence
Truth table
Graph theory
Edge
Directed edge
Edge
Edge endpoints
Weighted edge
Graph Coloring
Graph coloring
Graph coloring
Graph coloring
Graph properties
Diameter (graph theory)
Distance (graph theory)
Graph representations
Adjacency list
Adjacency matrix
Distance Matrix
distance matrix
Incidence matrix
Transitive Closure
transitive closure
Weight Matrix
weight matrix
Graph travelling
Circuit
Cycle
Eulerian circuit
Eulerian trail
Hamiltonian cycle
Hamiltonian path
Negative weight cycle
Path
Trail
Walk
Graph types
Tree
Decision tree
Directed tree
Forest
Minimum spanning tree
Rooted tree
Spanning tree
Tree
Acyclic
Complete graph
Connected graph
Cyclic
Directed acyclic graph
Directed graph
Isomorphic Graph
Isomorphic graph
Labelled graph
Planar graph
Simple graph
Subgraph
Undirected graph
Weighted graph
Node
Adjacent nodes
Degree
Node
Source node
Target node
Weighted nodes
Topography
Isomorphism
Topography
Topological Sorting
Topological sorting
Applications of graph theory
Graph
Graph topology
Notation
Properties of Equivalence
Unit 4
Algorithm analysis
Big O examples
Big O examples
Fibanachi
Other Examples of Big-O
Algorithm analysis
Auxiliary space
Big-O Analysis
Combinatorial Explosion
Efficiency T(n)
Loop invariant
Other Notation
Space complexity
Algorithm Design patterns
Backtracking
Dynamic programming
Naive programming
Algorithms
Heuristics
Heuristic function
Heuristics
Hill climbing
Simulated Annealing
A(star) Search Algorithm
Algorithms
Binary search
Artificial Intelligence
Machine Learning
Binary classification
Feature
Linear classifier
Support Vector Machine
Training with Data
Types of Machine Learning
Neural Networks
Forward Propagation
Layer (neural network)
Model training
Multi-layer Perceptron
Overfitting and Underfitting
Perceptron
Resurgence in neural networks
Artificial Intelligence
Chinese Room Responses
Ethics of AI
Searle's Chinese Room Argument
Turing Test
Weak and Strong AI
NP Complete Problems
0-1 Knapsack Problem
Graph Coloring Problem
Travelling Salesman Problem (TSP)
Philosophical Problems
Entscheidungsproblem
Halting Problem
Limits of Computability
Turing Machines
Foundational crisis of mathematics
Hilbert's Program
State diagram (Turing machine)
Turing Machine
Complexity Classes
Deterministic algorithm
Master Theorem
Tractable problems
Untitled
About the authors
Study Design
Home
❯
Unit 4
❯
Algorithm analysis
❯
Auxiliary space
Auxiliary space
Aug 23, 2025
1 min read
Extra space or temporary space used by an algorithm.
Graph View
Backlinks
Space complexity