COMM-1206EL Lecture Notes - Lecture 8: Readme, Sorting Algorithm, Bubble Sort

• School: Laurentian
• Department: Commerce and Administration
• Course: COMM-1206EL
• Professor: Culliford Leda

Document Summary

In this lab session, students will demonstrate their knowledge of different introductory sorting algorithms. This lab must be submitted on courselink to receive marks, you must follow the submission guidelines and project structure. Please refer to courselink for due date information. Upon successful completion of this lab students should be able to: develop 2 of the 3 sorting algorithm introduced in the course. Implement a reusable interface for calling sort functions. In this lab, students will implement 2 sorting algorithms, which were studied in class. Students may select 2 algorithms to implement from insertion sort, bubble sort, and selection sort. In addition to implementing the algorithms, you will create a small command line interface that allows users to select the input values, sorting algorithm, and sorting method. The first portion of this lab will consist of creating a command line interface for a user to insert n values.