Patent ID: 8126877

Claim:
A method of arranging search engine results, comprising: obtaining by at least one processor a plurality of search engine results sorted according to relevancy, wherein the plurality of search engine results include at least one paid result and at least one unpaid result; grouping by at least one processor the sorted plurality of search engine results into at least two groups according to relevancy range without rearranging the sorted plurality of search engine results; sorting by at least one processor within each of the at least two groups according to payment amount while maintaining relative placement of the at least two groups, wherein within each of the at least two groups any unpaid results are placed below paid results; and creating by at least one processor a list of at least some of the plurality of search engine results in accordance with the sorting, wherein the obtaining, the grouping, the sorting and the creating are performed in real time; wherein each group comprises a different range of normalized relevancy scores, and wherein the grouping comprises determining a group for a given result according to the formula (N−S)/B where N=maximum possible normalized score for the at least one first criteria, S=normalized score of the given result for the at least one first criteria, and B=a predetermined range size of normalized scores for each group.