dc.contributor.advisor | Han, Yijie, 1959- | |
dc.contributor.author | Kunapuli, Sai Swathi | |
dc.date.issued | 2022 | |
dc.date.submitted | 2022 Fall | |
dc.description | Title from PDF of title page, viewed January 4, 2023 | |
dc.description | Thesis advisor: Yijie Han | |
dc.description | Vita | |
dc.description | Includes bibliographical references (pages 25-28) | |
dc.description | Thesis (M.S.)--Department of Computer Science and Electrical Engineering. University of Missouri--Kansas City, 2022 | |
dc.description.abstract | 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. | |
dc.description.tableofcontents | Introduction -- Sorting in constant time -- Searching in constant time -- Theorem -- Conclusions | |
dc.format.extent | vi, 29 pages | |
dc.identifier.uri | https://hdl.handle.net/10355/93812 | |
dc.subject.lcsh | Parallel algorithms | |
dc.subject.lcsh | Parallel processing (Electronic computers) | |
dc.subject.other | Thesis -- University of Missouri--Kansas City -- Computer Science | |
dc.title | Constant Time Sorting and Searching | |
thesis.degree.discipline | Computer Science (UMKC) | |
thesis.degree.grantor | University of Missouri--Kansas City | |
thesis.degree.level | Masters | |
thesis.degree.name | M.S. (Master of Science) | |