Why do we convert Recursive algorithms to DP typically? Analyse and compare the convenience and efficiency of recursive vs DP solutions for an edge case problem w/ Swift.

Analyse and compare the convenience and efficiency of DFS and BFS solutions for the Bipartite Graph detection problem (Swift).

Implement the Hoare + Lomuto Partitioning Schemes (QuickSort) with the Swift stdlib. Discuss wider application of the schemes to solve problems.

Use the Swift 4+ stdlib for writing a Min/Max Heap. Discuss challenge of implementing nonlinear data structures in Swift.