Nov 23, 2025 · 7 min read · Bubble sort (also called as Sinking Sort and Exchange Sort) is a straightforward sorting algorithm that operates by repeatedly comparing and swapping adjacent elements if they are in the wrong order. What is Bubble Sort? Bubble Sort is a comparison s...
Join discussion
Oct 15, 2025 · 5 min read · Unwind this Diwali with Bubble Me’s best shower gel — a soothing, paraben-free formula that relaxes your senses and nourishes your skin after every shower Diwali, the festival of lights, celebration, and endless gatherings, often leaves us drained — ...
Join discussionJun 18, 2025 · 2 min read · 🫧 1. Bubble Sort Compare adjacent pairs of elements in an array and swap them if they are in the wrong order, gradually moving larger elements to the end of the array. 1.1. Time Complexity Average / Worst case: O(n^2) Best case: O(n) (already so...
Join discussion
Jun 10, 2025 · 2 min read · 🧠 What is Bubble Sort? Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. It’s called "bubble" because the largest values "bubble up" to the en...
Join discussionMay 1, 2025 · 4 min read · Sorting a repeating group in Bubble.io is straightforward until you run into nested fields. Let’s say you’re displaying a list of Works, and each work has a related Work_satellite data type. Now, you want to sort your repeating group of Work by the W...
Join discussion
Apr 7, 2025 · 4 min read · Bubble Sort is a simple sorting algorithm that works by repeatedly comparing two adjacent elements in an array and swapping them if they are in the wrong order. Just like bubbles rise to the top in water, in Bubble Sort the biggest numbers slowly mov...
Join discussion
Mar 9, 2025 · 38 min read · Sorting means arranging a given array or list of elements based on a comparison operator. This operator helps determine the new order of the elements in the data structure. For example, you may need to sort the array in descending or ascending order,...
Join discussion
Feb 8, 2025 · 4 min read · Logic→ We take two nested loops the outer loop which will run from 0 to the length of items in array and the second loop running from 1 to the length of array - i times its doing so because if we run loop 1st time it will sort the loop keeping the bi...
Join discussion
Feb 6, 2025 · 6 min read · There’s a beauty to this little algorithm. I learnt a ton from it. It helped me grasp the nature of nested loops and how to be careful about accessing a loop within its bounds.I still screw up with loops all the time but this process gave me some goo...
Join discussion