A comparative study of linked list sorting algorithms

  • Authors:
  • Ching-Kuang Shene

  • Affiliations:
  • -

  • Venue:
  • 3C ON-LINE
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

Carraway recently published an article [2] describing a sorting algorithm (the sediment sort) for doubly linked lists. He claimed that the sediment sort is one of the fastest and most efficient sorts for linked list, and planned to determine its complexity. In this article, a comparative study will be presented to show that the sediment sort is only a minor variation of the bubble sort which has been known to the computer science community for more than three decades and that the sediment sort is perhaps the slowest algorithm for sorting linked lists.