Finding superlatives in an unordered list

Details Finding superlatives in an unordered list Finding superlatives in an unordered list

2011-03-15

2011-03-15

Kim, Charles (Department: 2157)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

C026S027000

Reexamination Certificate

active

07908283

ABSTRACT:
The k first elements from an unordered list of n total elements are copied to a result buffer, wherein k is a value smaller than n. The k first elements in the result buffer are sorted. Each subsequent element in the unordered list is compared to elements in the result buffer. If the subsequent element belongs in the result buffer, a current element in the result buffer is replaced with the subsequent element. The elements in the result buffer are then resorted.

REFERENCES:
patent: 2005/0114375 (2005-05-01), Frieder et al.
patent: 2005/0283573 (2005-12-01), Mewhinney et al.
patent: 2008/0306819 (2008-12-01), Berkhin et al.

Affiliated with

Also associated with

Rating

Finding superlatives in an unordered list does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Finding superlatives in an unordered list, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding superlatives in an unordered list will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2779046