Mergesort

Mergesort Mergesort is an efficient and widely used sorting algorithm. Stable sorting algorithm: preserves the order optimal time complexity: N log N in all cases suboptimal in space usage: usage of an extra array for merging Usage examples: Sorting Linked Lists when space is not a concern. Java default algorithm Read more…

Data Structures

Good knowledge of common data structures is needed in computer science. This article describes common data structures, and present cost and benefits. Lists A List is an abstract data type representing a finite collection of ordered elements. Typically, a List is allocated dynamically depending on the implementation. For example, Array-based Read more…