{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/93812"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/93812","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"Constant Time Sorting and Searching","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Kunapuli, Sai Swathi"],"institution":"University of Missouri--Kansas City","degree_name":"M.S. (Master of Science)","degree_level":"Masters","degree_discipline":"Computer Science (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Han, Yijie, 1959-"],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022","date_published":"2022","updated_at":"2026-07-24T05:18:22Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10355/93812","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Han, Yijie, 1959-"]},{"key":"dc:creator","label":"Author","values":["Kunapuli, Sai Swathi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-01-03T17:06:01Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-01-03T17:06:01Z"]},{"key":"dc:date.issued","label":"Date","values":["2022"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S. (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10355/93812"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page, viewed January 4, 2023","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 25-28)","Thesis (M.S.)--Department of Computer Science and Electrical Engineering. University of Missouri--Kansas City, 2022"]},{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Constant Time Sorting and Searching"]}]}],"canonical_facts":{"dc:contributor.advisor":["Han, Yijie, 1959-"],"dc:creator":["Kunapuli, Sai Swathi"],"dc:date.accessioned":["2023-01-03T17:06:01Z"],"dc:date.available":["2023-01-03T17:06:01Z"],"dc:date.issued":["2022"],"dc:description":["Title from PDF of title page, viewed January 4, 2023","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 25-28)","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:identifier.uri":["https://hdl.handle.net/10355/93812"],"dc:title":["Constant Time Sorting and Searching"],"thesis:degree_discipline":["Computer Science (UMKC)"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.S. (Master of Science)"],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:18:22Z"}