期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2016
卷号：5
期号：5
页码：1275-1279
出版社：Shri Pannalal Research Institute of Technolgy
摘要：Sorting is one of the most fundamental problems in computer science, as it is used in most software applications. Data-driven algorithms especially use sorting to gain an efficient access to data. Many sorting algorithms with distinct properties for different architectures have been developed. Searching for items and sorting through items are tasks that we do every day. Searching and sorting are also common tasks in computer programs. We search for all occurrences of a word in a file in order to replace it with another word. We sort the items on a list into alphabetical or numerical order. Because searching and sorting are common computer tasks, we have well-known algorithms, for doing searching and sorting. We’ll look at two searching algorithms and four sorting algorithms here in detail, and go through examples of each algorithm and determine the performance of each algorithm, in terms of how “quickly” each algorithm completes its task.
