Saad's Teaching Portal

In this lecture, we discussed the Insertion Sort Algorithm. The insertion sort algorithm acts linearly on the data structure like the bubble and selection sort as we discussed in the previous lectures. But a difference between these algorithms and the insertion sort algorithm is, the insertion sort algorithm requires two variables to traverse the data structure and the outer loop executes the respected variable as the leading variable and the inner loop executes as the lagging variable. The insertion sort algorithm is widely implemented in professional real-life projects compared to the bubble sort algorithm or selection sort algorithm. Before code implementation, we must know the visualization of the algorithm. Here we discussed the algorithm in three parts. First, we discussed the theory of the bubble sort algorithm then we discussed the visualization and last we implemented the algorithm in a compiler using the C programming language.

Video:

Algorithms [ Insertion Sort Algorithm ] | Brute Force Algorithms [ Insertion Sort Algorithm ] | Brute Force In this video, we discussed the insertion sort algorithm. The insertion sort algorithm acts linearly on...

Bubble Sort Algorithm, is another popular sorting algorithm that operates on an unsorted data structure by swapping two elements from the beginning at each step. Bubble Sort Algorithm has a similarity with Selection Sort Algorithm in that both algorithms operate on the data structure linearly. In this lecture, we discussed the theory, visualization, and code implementation.

Video:

Algorithms [ Bubble Sort Algorithm ] | Brute Force Algorithms [ Bubble Sort Algorithm ] | Brute ForceIn this video, we discussed the bubble sort algorithm. The bubble sort algorithm acts linearly on the data ...

Selection Sort Algorithm is one of the most popular sorting algorithms that operate on an unsorted data structure by swapping the smallest with the largest at each step. This is the very first sort algorithm that we discussed in our playlist. The selection Sort Algorithm takes the same time complexity for both best and worst case. Only two algorithm does this, one is Selection Sort Algorithm and another one is due to be discussed the Merge Sort Algorithm. However, during this lecture, we discussed the procedure, working process, and implementation of the Selection Sort Algorithm.

Video:

Algorithms [ Selection Sort ] | Saad's Teaching Portal Click here for lecture contents: https://saadkamal219.github.io/saadsteachingportal/algorithms.html -4

Binary Search Algorithm, is the most optimal search algorithm that operates on the data structure by logarithm basis. Each time the loop turns, the array is divided into subarrays according to the relation between the target element and the middle element of the array. During the discussion first, we discussed the characteristics of binary search, then we visualized the searching process, and last we implemented the algorithm in the compiler.

Video:

Algorithms [ Binary Search Algorithm ] | Saad's Teaching Portal Click here for lecture contents: https://saadkamal219.github.io/saadsteachingportal/algorithms.html -3

Linear Search Algorithm, is a very simple search algorithm that linearly operates on the data structure. During the discussion first, we discussed the characteristics of linear search, then we visualized the searching process, and last we implemented the algorithm in the compiler.

Video:

Algorithms [ Linear Search Algorithm ] | Brute Force Here you will find the slides or other contents:https://saadkamal219.github.io/saadsteachingportal/algorithms.html -2

In the Ice Breaking Session, we discussed the course overview and the basic concept of algorithms and algorithms. We discussed the approaches, recommendations, and concepts of various algorithms. We also discussed the course recommendations that the viewers must have basic skills in C Programming Language and I provided the link to the C Programming Language full course from w3schools. It was just an ignition. The whole course is beyond this.

Video link:

Algorithms [ Ice Breaking Session ] Here you will find the slides or other contents:https://saadkamal219.github.io/saad-s-teaching-portal/algorithms.htmlThis is the first session where we will ...

Starting from the basic concept of Algorithms to 20+ techniques to search an element, sort arrays, finding the shortest path, etc. Many students find learning algorithms hard. Is it true? Of course not. When you are writing the algorithm you must feel the steps and the process. That doesn't make any sense right? Feeling the steps of the algorithm? Well, I'll help you all the way it is possible. Enough talk, let's start !!!

Algorithm course link: https://saadkamal219.github.io/saadsteachingportal/algorithms.html

Hello people. As a student, I know that we often feel confused while choosing the topic that we need to focus on. We are computer engineers, and there are a lot of topics that we can focus on but we can't manage all of them. So what topics will we choose? And from where you will learn that? So, I am here to help you out. Let's start the journey and I will try my best to enrich your knowledge.