In mathematics and computer science, an algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. Algorithms are always unambiguous and are used as specifications for performing calculations, data processing, automated reasoning, and other tasks.
As a start point, let's address to Big-O Notation.
In the tutorial the following algorithms will be described:
- Sort Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Shell Sort, Merge Sort, Quick Sort, Counting Sort, Radix Sort, Bucket Sort;
- Search Algorithms: Linear Search. Binary Search;
- Other Algorithms: Factorial.
- Java 11+
- Maven 3.6+