文献类型：期刊文献

中文题名：基于分治法的单链表存储结构的快速排序算法

英文题名：Quick Sorting Algorithm of Singly Linked List Storage Structure Based on the Divide-and-conquer Algorithm

作者：王晓洁[1]

第一作者：王晓洁

机构：[1]新乡学院计算机与信息工程学院

第一机构：新乡学院计算机与信息工程学院

年份：2017

卷号：34

期号：9

起止页码：30-33

中文期刊名：新乡学院学报

外文期刊名：Journal of Xinxiang University

语种：中文

中文关键词：快速排序算法;顺序存储结构;分治法思想;单链表存储结构;递归方法

外文关键词：quick sorting algorithm; sequential storage structure; divide-and-conquer algorithm; singly linked list storage structure; recursive method

摘要：平均时间效率最高的快速排序算法适合于具有随机访问特性的顺序存储结构,但不适合单链表。通过分析分治法思想、快速排序算法、递归方法和单链表存储结构,提出了适合于单链表存储结构的快速排序算法。
The quick sorting algorithm with the highest average time efficiency is suitable for the sequential storage structure with random access characteristics, not suitable for singly linked list storage structure. Quick sorting algorithm of singly linked list storage structure was proposed in this paper. By analyzing the divide-and-conquer algorithm, the quick sorting algorithm, the recursive method and singly linked list storage structure, a quick sorting algorithm suitable for singly linked list storage structure was proposed. It increased time efficiency for singly linked list sorting algorithm.