Algorithm-Experiment
June 2, 2015 ยท View on GitHub
##Introduction
Algorithm experiment code written by Swift
This is a worksapce built on target OSX 10.10. It contains several projects:
- ConvexHull
- LCS
- Hamiltonian Cycle
- N-Queen
##Environment
OSX Yosemite
##Projects
###ConvexHull
I solve this issue with three methods: BruteForce(O(n^4)), GrahamScan(O(nlogn)) and Divide&Conquer(O(nlogn)).
###LCS
Longest Common Sequence.
Divide&Conquer
Dynamic Programming
###Hamiltonian Cycle
BaseTreeSearch:Base back tracking,cut limb that had been searched.
HillClimbing:When searching neighbours,select the node that has minimum neighbours.
###N-Queen To save time, I implement this question with C++. The solution uses backtracking and random algorithm.