Sitemap

C++

G

• Developing Guess game step by step in C++

H

• How to write Hello World! in C++

P

• Pointers in-depth by the example of sorting C-strings

Data structures and algorithms

A

• Adjacency list
• Adjacency matrix
• Array

B

• Binary heap
    - array-based internal representation
    - insert a value
    - remove minimum
  
• Binary search
• Binary search tree
    - internal representation
    - adding a value
    - search for a value
    - removing a value
    - get values in order
  
• Binary tree
• Bubble sort

D

• Depth-first search (undirected graphs)
• Dictionary ADT
• Dynamic array
    - capacity management
    - access functions
  

G

• Graph

H

• Hash table
  - The very simple hash table example
  - Collision resolution by chaining (closed addressing)
  - Open addressing strategy (linear and quadratic probing, double hasing)
  - Dynamic resizing

I

• Insertion sort

M

• Merge algorithm (for sorted arrays)

P

• Primality test (naive)
• Priority queue

Q

• Quicksort

R

• Recursion

S

• Selection sort
• Sieve of Eratosthenes
• Singly-linked list
    - internal representation
    - traversal
    - adding a node
    - removing a node
  
• Stack
    - array-based implementation