Constant Time Sorting and Searching

To study the sorting of real numbers into a linked list on Parallel Random Access Machine model. To show that input array of n real numbers can be sorted into a linked list in constant time using n²/logᶜn processors for any positive constant c. The searching problem studied is locating the interval of n sorted real numbers for inserting a query real number. Taking into account an input of n real numbers and organize them in the sorted order to facilitate searching. Initially, sorting the n input real numbers and then convert these real numbers into integers such that their relative order is preserved. Convert the query input real number to a query integer and then search the interval among these n integers for the insertion point of this query real number in constant time.

Name thesis:degree_name

M.S. (Master of Science)

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Computer Science (UMKC)

Grantor

University of Missouri--Kansas City

Year dc:date.issued

2022

Author dc:creator

• Kunapuli, Sai Swathi

Advisor dc:contributor.advisor

• Han, Yijie, 1959-

Handle dc:identifier.uri

https://hdl.handle.net/10355/93812

OAI identifier oai:identifier

oai:mospace.umsystem.edu:10355/93812