A New Algorithm to Find The K th Smallest Element in an Unordered List (Efficient for Big Data)
2022 2nd International Conference on Computing and Information Technology (ICCIT)（2022）
摘要
Finding the kth smallest element in an unsorted list of values is of vital importance in several disciplines and applications such as image and signal processing, machine learning, feature extraction, statistics, trend analysis, genome sequencing and many others. Different algorithms that find the kth smallest element in an unsorted list of values were presented in literature...
更多查看译文
关键词
big data,median,unsorted list,search algorithm,sorting,kth smallest element
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要