#bubble sort algorithm

Bubble Sort in JavaScript

আজ তেমন কিছু বলবো না। আজ আমি একটা সমস্যা সমাধান করলাম। কিভাবে করলাম সেটা নিয়ে আলোচনা করবো। যদি ভালো লাগে পড়তে পারেন।এখন সমস্যা টা উল্লেখ করবো। Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. Example 1: Input: nums = [-4,-1,0,3,10] Output: [0,1,9,16,100] Explanation: After squaring, the array becomes…

The bubble sort algorithm is also known as the sinking algorithm. In this algorithm, we iterate over the array, and it takes two adjacent elements and swaps them if they are in the wrong order (ascending or descending). The step is continued until the whole array is sorted in a particular manner (ascending or descending).

Though the algorithm works poorly in real-world tools, due to its simplicity bubble sort algorithm is introduced as a primary tool when the algorithm concept is started.  This algorithm takes a lot of time when the number of exchanges is more.

The bubble sort algorithm is also known as the sinking algorithm. In this algorithm, we iterate over the array, and it takes two adjacent elements and swaps them if they are in the wrong order (ascending or descending). The step is continued until the whole array is sorted in a particular manner (ascending or descending).

Though the algorithm works poorly in real-world tools, due to its simplicity bubble sort algorithm is introduced as a primary tool when the algorithm concept is started.  This algorithm takes a lot of time when the number of exchanges is more.

Bubble Sort 

Bubble Sort

Introduction:

In bubble sort method the list is divided into two virtual sub-lists called unsorted and sorted. The smallest element is bubbled from unsorted sub-list to sorted sub-list. After moving the smallest element the imaginary wall moves one element ahead.

The bubble sort was originally written to bubble up the highest element in the list. But there is no difference whether…