Free Online Tutorial For Programmers, Contains a Solution For Question in Programming. Quizzes and Practice / Company / Test interview Questions.
Course Overview:
In this course, we can learn the following concepts
Algorithms and types:
[su_youtube url="https://youtu.be/yPV4TH45zFc" title="Linked List"] Linked list What is a linked list? Are container where data is stored in nodes The nodes consist single data item and pointer/reference to the next node What is a node? The node is nothing but a link in the linked list The node contains two…
Data structures and algorithms Course Overview: This course covers the concept of data structure and algorithms All data structures have been explained with introduction, advantages and disadvantages The good images have been attached for every chapter which makes it easy to understand the concepts The algorithms have been explained with…
[su_youtube url="https://youtu.be/5mHtlmo_aRw" title="Question - 1"] [su_youtube url="https://youtu.be/rTTwMmTG0w8" title="Question - 2"] [su_youtube url="https://youtu.be/Pztk2IiI7jM" title="Question - 3"] [su_youtube url="https://youtu.be/zQ37KeSyMB4" title="Question - 4"] [su_youtube url="https://youtu.be/o_rkxiKPQLI" title="Question - 5"] [su_youtube url="https://youtu.be/YHL4Y8ViWkc" title="Question - 6"] [su_youtube url="https://youtu.be/VvkyxQ4ymJ0" title="Question - 7"] [su_youtube url="https://youtu.be/qK3jdDt8DAE" title="Question - 8"] [su_youtube url="https://youtu.be/_tqUgH9rn7o" title="Question - 9"] [su_youtube url="https://youtu.be/zzz6I5hN7LY" title="Question - 10"]…
Heapsort In this article, we will learn about heapsort in javascript. Heapsort can be thought of as an improved selection sort: like selection sort, heapsort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element from it and…
Insertion Sort How it works Insertion sorting algorithm starts iteration with choosing the one input element from the array, In every iteration, the insertion sorting algorithm moves the one element from the input array to the sorted array by finding its location where it shall be, It repeats until no…
Quicksort How it works Quicksort starts iteration by Picking a Pivot element, Pivot can be chosen from the: The first element of an array or Last element of an array or The middle element of an array or Any random element of an array, It follows the principle…
Selection Sort How it works It divides the array into two parts, First sub-array: The part of the array that’s been sorted, its remains on the left side., Second sub-array: The remaining is an unsorted array and has to be sorted, it remains on the right side Process The…
Bubble Sort How it works Sorts an array of n elements in ascending or descending order, It swaps the element if the right element is smaller than the left element Ascending order: In ascending order, starts comparing the first element of an array with the second element. If the…
Binary search Introduction Binary search compares the key element to the middle element of the array, If they are not equal, the half in which the key element cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the…
Linear Search Introduction: The linear search loops an entire array sequentially and finds the matching element value, Stops looping if the key element is found or the whole list is finished, Performance: The maximum time to find a matching element is 0(n), Best case: The linear search algorithm suits best…