Sorting Algorithms in JavaScriptSorting is an important operation in computer science that arranges elements of an array or list in a certain order (either ascending or descending).Example:Input: [64, 34, 25, 12, 22, 11, 90]Output: [11, 12, 22, 25, 34, 64, 90] Input: [1, 2, -3, 3, 4, 5]Output: [-3, 1, 2, 3, 4, 5] Table of ContentB
5 min read
Bubble Sort algorithm using JavaScriptBubble sort algorithm is an algorithm that sorts an array by comparing two adjacent elements and swapping them if they are not in the intended order. Here order can be anything like increasing or decreasing. How Bubble-sort works?We have an unsorted array arr = [ 1, 4, 2, 5, -2, 3 ], and the task is
4 min read
Javascript Program For Counting Inversions In An Array - Set 1 (Using Merge Sort)Inversion Count for an array indicates - how far (or close) the array is from being sorted. If the array is already sorted, then the inversion count is 0, but if the array is sorted in the reverse order, the inversion count is the maximum. Formally speaking, two elements a[i] and a[j] form an invers
5 min read
How to Create an Array using Intersection of two Arrays in JavaScript ?In this article, we will try to understand how to create an array using the intersection values of two arrays in JavaScript using some coding examples. For Example: arr1 = [1, 3, 5, 7, 9, 10, 14, 15]arr2 = [1, 2, 3, 7, 10, 11, 13, 14]result_arr = [1, 3, 7, 10, 14]Approach 1: We will see the native a
3 min read