🫧 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...
What is Selection Sort? Selection Sort is one of the simplest sorting algorithms in computer science. It works by repeatedly selecting the smallest element from the unsorted part of the list and moving it to the beginning. The list gets sorted one el...
Selection Sort is a sorting method that picks the smallest number from the list and puts it at the front. It keeps doing this until the whole list is sorted. Working of Selection Sort Set the first element as minimum. Compare minimum with the seco...
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,...
Introduction Suppose you are organizing a deck of cards, and you want to sort it from the smallest to the largest. Naturally, you might look through the cards, find the smallest one, and place it first. Then you would look for the next smallest, and ...
When analyzing algorithms, the concept of space complexity often accompanies its counterpart, time complexity. However, the term is frequently misused or conflated with auxiliary space. This article clarifies the differences, highlights their signi...
Example with Explanation: Let’s take the array: [64, 25, 12, 22, 11] Step-by-Step Execution: First pass (i=0): Initial array: [64, 25, 12, 22, 11] Find the smallest element from the entire array (from index 1 to 4). The smallest element is 11 at ...
Sorting algorithms are essential for understanding computer science and solving numerous practical problems. Among them, Selection Sort stands out as a straightforward algorithm, often used for educational purposes due to its simplicity. In this arti...
Overview O(n²) Time Complexity in all cases. Does less “Memory writes” when compared with other algorithms such as Quick sort, Merge sort, Insertion sort and Bubble sort. However, not an optimal algorithm in terms of “Memory writes”. There is othe...
Sorting algorithms are the backbone of many programming applications, and Selection Sort is one of the easiest to understand. If you're diving into algorithms for the first time, this one is a great place to start. In this blog, we'll break down the ...
