Objectives

At the end of this part each student will be able to:

• accurately and precisely describe the concepts present

  in the chapter of the reference book dealing with sorting algorithms

• implement and evaluate classical sorting algorithms,

  know their advantages, disadvantages and properties.

To read

Reference book:

• Chapter 1, section 1: some reminders of Java and programming in general (part on the Binary Search)

• Chapter 2, Section 1: Elementary Sorting

• Chapter 2, Section 2: Merge Sort

• Chapter 2, Section 3: Quick Sort

• Chapter 2, Section 5: Applications of sorting algorithms

Slides

• Slides exercises

• Slides restructuration