Section Recap

Bitmask subsets: O ( 2 n ) O(2^n) O ( 2 n ) enumeration.
Permutations: O ( n ! ) O(n!) O ( n !) enumeration.
Meet in the middle: Reduce O ( 2 n ) O(2^n) O ( 2 n ) to O ( 2 n / 2 ) O(2^{n/2}) O ( 2 n /2 ) .
Pruning: Cut branches that can't lead to solutions.
Iterative deepening: BFS optimality with DFS memory.
Branch and bound: Prune with optimistic bounds.

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/complete-search/section-recap

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/fundamental-algorithms/complete-search/section-recap

Repovive

Section Recap - Complete Search | Fundamental Algorithms | Repovive