We use cookies to improve your experience with our site.
Gao Qingshi. A Unified O(log N) and Optimal Sorting Vector Algorithm[J]. Journal of Computer Science and Technology, 1995, 10(5): 470-475.
Citation: Gao Qingshi. A Unified O(log N) and Optimal Sorting Vector Algorithm[J]. Journal of Computer Science and Technology, 1995, 10(5): 470-475.

A Unified O(log N) and Optimal Sorting Vector Algorithm

  • A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary num-bers with clog. N-bits on an SIMD multi-processor system (SMMP) with processors and a composite interconnected network in time, where c is an arbitrary positive constant. When is an arbitrary small posi-tive constant and u = log2 N, it is an O(logN) algorithm and when it is an optimal algorithm,pT = O(N log N)); where u = 1, c = 1 and e = 0.5 (a constant).
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return