Udemy - FPGA Sort Algorithm 01

What you'll learn:
FPGA Sort Algorithm
Requirements
People who are interested in FPGA
Description
This series of lessons will focus on the FPGA sort algorithm introduction, verilog coding and simulation. It includes bubble sort , selection sort and insertion sort three parts:
(1) Bubble Sort:
Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The pass through the list is repeated until the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller or larger elements "bubble" to the top of the list. This bubble sort is a very classic sort algorithm. It is often used in the job interview. It is also a good way to practice the verilog coding skill;
(2) Selection Sort:
The algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
(3) Insertion Sort:
Insertion sort iterates, consuming one input element each repetition, and grows a sorted output list. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.
Who this course is for
People who are interested in FPGA and Sort Algorithm
Homepage

https://www.udemy.com/course/fpga-sort-algorithm-01/