Jan 27 · 4 min read · Selection Sort is one of those beginner sorting algorithms which despite not being very efficient, form important foundation concepts. This article explains it in a very beginner-friendly way and even portrays some comparisons with insertion sort. AL...
Join discussionNov 25, 2025 · 5 min read · Selection Sort is a simple sorting algorithm that repeatedly finds the smallest (or the largest) element from the unsorted part and moves it to its correct position. What is Selection Sort? Selection sort is a comparison sort algorithm. It repeatedly...
Join discussion
Nov 23, 2025 · 4 min read · This week of CS50 honestly hit different. Even though I come from a computer science background — and I’ve already studied searching, sorting, and Big-O — Week 3 felt like that moment when you clean your room and suddenly find things you forgot you e...
Join discussion
Oct 30, 2025 · 10 min read · A very classic problem in the field of algorithms is the sorting problem — the goal is to arrange a set of data, usually in the form of a list, in ascending or descending order. The Selection Sort algorithm is an excellent starting point. It’s great ...
Join discussion
Jun 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 12, 2025 · 2 min read · 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...
Join discussionApr 8, 2025 · 3 min read · 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...
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
Jan 11, 2025 · 9 min read · 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 ...
Join discussion
