User Tools

Site Tools


recursive_examples

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
recursive_examples [2017/12/26 18:40]
luciano
recursive_examples [2017/12/26 18:41] (current)
luciano
Line 3: Line 3:
 From [[https://​pastebin.com/​E5f997cG|Al Sweigart'​s list of recursive programming problems.]] From [[https://​pastebin.com/​E5f997cG|Al Sweigart'​s list of recursive programming problems.]]
  
-- ALL FRACTALS (Sierpinski Triangle/​Square,​ Koch Snowflake, Trees, Ferns, Hilbert Curve, etc.) +  ​- ALL FRACTALS (Sierpinski Triangle/​Square,​ Koch Snowflake, Trees, Ferns, Hilbert Curve, etc.) 
-- fibonacci +  - fibonacci 
-- factorial +  - factorial 
-- GCD +  - GCD 
-- collatz sequence +  - collatz sequence 
-- towers of hanoi +  - towers of hanoi 
-- eight queens problem +  - eight queens problem 
-- hadamard matrix +  - hadamard matrix 
-- flood fill +  - flood fill 
-- palindrome detection +  - palindrome detection 
-- binary search +  - binary search 
-- reversing a string/​linked list +  - reversing a string/​linked list 
-- sum/​multiply the numbers in a list +  - sum/​multiply the numbers in a list 
-- sum the digits of a number +  - sum the digits of a number 
-- binary tree traversal +  - binary tree traversal 
-- maze backtracking +  - maze backtracking 
-- permutations +  - permutations 
-- combinations +  - combinations 
-- all subsets of a set +  - all subsets of a set 
-- quick sort +  - quick sort 
-- merge sort +  - merge sort 
-- boggle +  - boggle 
-- adding a child to a binary tree +  - adding a child to a binary tree 
-- validating a binary tree +  - validating a binary tree 
-- making change with coins of various denominations +  - making change with coins of various denominations 
-- find out if two nodes are connected in a graph +  - find out if two nodes are connected in a graph 
-- editing distance/​levenshtein distance +  - editing distance/​levenshtein distance 
-- knapsack problem (where items have value and size/​weight) +  - knapsack problem (where items have value and size/​weight) 
-- word ladders (least > last > lost > cost > coast > cast > cask > mask > mast > most) +  - word ladders (least > last > lost > cost > coast > cast > cask > mask > mast > most) 
-- file system directory traversal +  - file system directory traversal 
-- number of paths through an N x N grid +  - number of paths through an N x N grid 
-- how many ways to go up N steps if you can go 1, 2, and/or 3 steps at a time +  - how many ways to go up N steps if you can go 1, 2, and/or 3 steps at a time 
-- find a magic index in a distinct (also, not distinct) sorted array, a magic index is i where A[i] == i +  - find a magic index in a distinct (also, not distinct) sorted array, a magic index is i where A[i] == i 
-- get the highest stack of boxes from a set of boxes with widths/​depths/​heights and each box's width & depth must be equal/​smaller than the one below it +  - get the highest stack of boxes from a set of boxes with widths/​depths/​heights and each box's width & depth must be equal/​smaller than the one below it 
-- Newton'​s square root method+  - Newton'​s square root method
recursive_examples.txt · Last modified: 2017/12/26 18:41 by luciano