Comparative Evaluation of Some Sorting Algorithms and Proposal of Binary Search Insertion Sort

IR (HANDLE) Web Site Open Access

Bibliographic Information

Other Title
  • 整列アルゴリズムの比較評価と二分探索挿入ソートの提案

Search this article

Description

We studied on typical sorting algorithms, compared their efficiencies, and proposed and evaluated a new sorting algorithms. In this paper, for some typical sorting algorithms, the principle and properties of each algorithm are described, and a function-type program in C language is given. Numerical experiments were used to compare and evaluate the execution times of the three O(n2) sorting algorithms (i.e., Bubble sort, Insertion sort and Selection sort) and the three O(nlogn) sorting algorithms ( i.e., Quicksort, Heaposrt and Mergesort). Furthermore, we proposed a new algorithm called Binary search insertion sort, compared it with the conventional Insertion sort, and confirmed that it can sort at a high speed of about 68%.

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top