Reduced comparison coordinate-value sorting process

Details Reduced comparison coordinate-value sorting process Reduced comparison coordinate-value sorting process

2008-07-22

2008-07-22

Ly, Cheyne D (Department: 2168)

Data processing: database and file management or data structures

Database design

Data structure types

Reexamination Certificate

active

07403944

ABSTRACT:
One objective of the present invention is to optimize a sorting process (20) that, by novel means (240), reduces the number of comparisons required to sort delivered items (10, 230) whether said items are physical tokens, electronic data or other symbolic representations of whatever is sorted. Said novel means (240) include: initializing values (220), recording values (250), comparing items found closest to evolving centroids (310, 320), restricting evolving fields for comparison within limits (330), setting pointers indicating the sorted order of items (360), detecting delivered items and those remaining within limits (60, 260), noting value changes (30, 250), and appropriate recursions (270, 280, 350, 370). A second objective of the present invention is to provide computer software means for said process (20) whereby said novel means (240) can be operably coupled with an apparatus to find items (40) and place them in ordered queues (50) as items (70).

Affiliated with

Also associated with

Rating

Reduced comparison coordinate-value sorting process does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reduced comparison coordinate-value sorting process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced comparison coordinate-value sorting process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2764157