基于2维极大点的倒序取舍算法 |
| |
作者单位: | 曲靖师范学院计算机科学与工程学院,湖南大学软件学院 |
| |
摘 要: | 探讨了求2维极大点的一种创新算法(倒序取舍算法),该算法比分治算法时间复杂度低.由此提出倒序取舍算法的思想及其应用.
|
关 键 词: | 极大点 分治法 时间复杂度 拓扑排序 |
A New Solution for Finding the Maxma of 2D Base on Inverted-order Choices Algorithm |
| |
Authors: | Li Ping Kuang Yuejuan Yang Wei |
| |
Institution: | Li Ping1,Kuang Yuejuan2,Yang Wei2 |
| |
Abstract: | This article discusses a innovation algorithm(inverted-order choices algorithm) to find the maxima of 2-dimension.The time-complexity of this algorithm lower than that of divide-and-conquer strategy.We proposed the inverted-order choices algorithm and its application. |
| |
Keywords: | maximum point divide-and-conquer strategy time complexity topological sorting |
本文献已被 CNKI 等数据库收录! |