Linear Transform Sort
- Conference
- Location
-
Virtual Conference
- Publication Date
-
July 26, 2021
- Start Date
-
July 26, 2021
- End Date
-
July 19, 2022
- Conference Session
-
Computing and Information Technology Division Poster Session
- Tagged Division
-
Computing and Information Technology
- Page Count
-
11
- DOI
-
10.18260/1-2--37461
- Permanent URL
-
https://peer.asee.org/37461
- Download Count
-
408
Paper Authors
Soren Peter Henrichsen Utah Valley University
Soren Henrichsen is a student at Utah Valley University. His interests include artificial intelligence, algorithms, robotics, machine learning, and statistics.
Reza Sanati-Mehrizy Utah Valley University
Reza Sanati-Mehrizy is a professor of the Computer Science Department at Utah Valley University, Orem, Utah. He received his M.S. and Ph.D. in Computer Science from the University of Oklahoma, Norman, Oklahoma. His research focuses on diverse areas such as Database Design, Data Structures, Artificial Intelligence, Robotics, Computer-Aided Manufacturing, Data Mining, Data Warehousing, and Machine Learning.
Afsaneh Minaie Utah Valley University
Afsaneh Minaie is a Professor and Chair of Engineering Department at Utah Valley University. She received her B.S., M.S., and Ph.D. all in Electrical Engineering from University of Oklahoma. Her research interests include gender issues in the academic sciences and engineering fields, Embedded Systems Design, Mobile Computing, Wireless Sensor Networks, Nanotechnology, Data Mining and Databases.
Abstract
This paper outlines the linear transform sort and its ideal and worst use cases. In general, a transform sort generates new keys in the range from 0 to n by a mathematical transformation, then uses those keys to sort the data set. We will prove the functionality of the linear transform sort and show that the complexity is O(n) for flat data distributions, and O(n^2) in the worst case. Linear transform sorting may be useful for flat data distributions but is mostly a proof of concept for future transform sorting algorithms, such as adaptive transformations or specific transformations for normally distributed data or other known data distributions
Henrichsen, S. P., & Sanati-Mehrizy, R., & Minaie, A. (2021, July), Linear Transform Sort Paper presented at 2021 ASEE Virtual Annual Conference Content Access, Virtual Conference. 10.18260/1-2--37461
ASEE holds the copyright on this document. It may be read by the public free of charge. Authors may archive their work on personal websites or in institutional repositories with the following citation: © 2021 American Society for Engineering Education. Other scholars may excerpt or quote from these materials with the same citation. When excerpting or quoting from Conference Proceedings, authors should, in addition to noting the ASEE copyright, list all the original authors and their institutions and name the host city of the conference. - Last updated April 1, 2015