Nothing here yet.
Nothing here yet.
Feb 5, 2021 · 2 min read · Merge Sort is one of the most popular sorting algorithms that is based on the principle of the Divide and Conquer Algorithm. Steps Divide the unsorted list into n sublists, each comprising 1 element (a list of 1 element is supposed sorted). Repeate...
Join discussionFeb 4, 2021 · 2 min read · Selection sort is an algorithm that selects the smallest element from an unsorted list in each iteration and places that element at the beginning of the unsorted list. Steps: array = [64, 25, 12, 22, 11] Find the minimum element in array[0...4] and ...
Join discussionFeb 4, 2021 · 2 min read · Insertion sort is a sorting algorithm that places an unsorted element at its suitable place in each iteration. Steps The first element in the array is assumed to be sorted. Take the second element and store it separately in key. Compare key with th...
Join discussionFeb 3, 2021 · 2 min read · Bubble sort is an algorithm that compares the adjacent elements and swaps their positions if they are not in the intended order. Steps Iterate through the array and check each element against the next element in the array. If the current element is ...
Join discussionFeb 2, 2021 · 2 min read · Async and defer are boolean attributes that are used along with the script tag to load the external scripts efficiently into our webpage. Normal Script: Suppose the browser is loading a webpage and parsing the HTML line by line and suddenly encounter...
SSami commented