|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Winter 2011 Fractional Cascading Hiep Huynh 
ABSTRACT This report presents the documentation and the testing result of the implementation of two algorithms searching on directed connected graph. The first algorithm is binary search in the sequence takes a logarithmic amount of time. Second algorithm implements the Fractional Cascading to improve the complexity running time. |
||||||
|
