Sort students marks using bubble and insertion algorithms

The learner will create two sorting algorithms in Java programming language. The learner will create an optimised bubble sort function that sorts students' marks in ascending order by repeatedly swapping adjacent elements within an array if they are in the wrong order. The learner will also create an insertion sort function that sorts students' marks in ascending order by building a sorted array, one element at a time.

• Project Overview
• In this project-based course, you will learn how to sort integers using bubble and insertion sort algorithms in Java programming language. The learner will create an optimised bubble sort function that sorts students' marks in ascending order by repeatedly swapping adjacent elements within an array if they are in the wrong order. After an iteration, if there are no elements to sort further, the iteration stops thus reducing execution time. The learner will also create an insertion sort function that sorts students' marks in ascending order by building a sorted array, one element at a time.