Skip to Main Content
Introducing Data Structures with Java
book

Introducing Data Structures with Java

by David Cousins
March 2013
Intermediate to advanced content levelIntermediate to advanced
416 pages
9h 41m
English
Pearson Education India
Content preview from Introducing Data Structures with Java

8

Sorting Arrays—Selection, Bubble, Insertion, Merge and Quick Sorts

Sorting Arrays Sorting Arrays

Contents

  • A fundamental operation—sorting array contents to create an ordered list
  • Five sorting algorithms—bubble, selection, insertion, merge and quick sorts
  • Recursion
  • Sorting algorithm efficiency
8.1 INTRODUCTION

In Chapter 6, we saw that an ordered array can use the efficient binary search method. If the data are initially unordered, how can they be sorted into order? This chapter addresses sorting operations, examines in detail five algorithms (from many that exist) and compares their efficiency with the Big-O expression for each.

8.2 GENERAL PRINCIPLES ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Structures and Algorithms Using Java

Data Structures and Algorithms Using Java

William McAllister

Publisher Resources

ISBN: 9788131758649