https://github.com/yulingtianxia/algorithm-experiment

Algorithm experiment code written by Swift
https://github.com/yulingtianxia/algorithm-experiment

Last synced: 3 months ago
JSON representation

Algorithm experiment code written by Swift

• Host: GitHub
• URL: https://github.com/yulingtianxia/algorithm-experiment
• Owner: yulingtianxia
• Created: 2014-11-24T15:16:18.000Z (over 10 years ago)
• Default Branch: master
• Last Pushed: 2016-09-20T09:12:21.000Z (almost 9 years ago)
• Last Synced: 2025-04-17T13:32:04.534Z (3 months ago)
• Language: Swift
• Size: 88.9 KB
• Stars: 46
• Watchers: 3
• Forks: 5
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Algorithm-Experiment

====================

##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)).   

![](http://7ni3rk.com1.z0.glb.clouddn.com/convexhull.png)

###LCS

Longest Common Sequence.  

Divide&Conquer  

Dynamic Programming  

![](http://7ni3rk.com1.z0.glb.clouddn.com/LCS1.png)  

![](http://7ni3rk.com1.z0.glb.clouddn.com/LCS2.png)  

###Hamiltonian Cycle

BaseTreeSearch:Base back tracking,cut limb that had been searched.

HillClimbing:When searching neighbours,select the node that has minimum neighbours.   

![](http://7ni3rk.com1.z0.glb.clouddn.com/[email protected])  

###N-Queen

To save time, I implement this question with C++. The solution uses backtracking and random algorithm.