Overview Selection sort is the most basic way of sorting an Array. We compare each element with its subsequent elements and swap them if one is smaller than the other. Complexity The complexity of selection sort algorithm for worst case, average cases and best cases is O(n2). Selection Sort in Java Selection Sort in C language Selection Sort in C++ … [Read more...] about Selection Sort

# Archives for July 2020

## Binary Search

What is Binary Search? Binary search is the fast method of searching for an element in an array. In this approach, we need the array in sorted order. In Binary search, we first identify the center of the array by dividing the array size by 2. Then, we compare the search element with an element present at the center of the array. If the element at center matches with the … [Read more...] about Binary Search

## Linear Search

A linear search is the simplest form of search in an array of elements. We can perform a linear search in three distinct ways based on the order of elements in an array. There can be three scenarios, elements are in ascending order, or descending order, or no order at all. If the array contains all the elements in ascending order, we'll search for the element in the … [Read more...] about Linear Search

## Docker Swarm on Play with Docker

Play with Docker If you are learning docker or if you want to try out a quick thing in docker, Play with Docker is the best place to do it. Play with Docker is a lab environment provided by Docker itself. To start playing around with docker, all you need to do is log in with your free docker id and start using it. You will get 4 hours of time to play around with it in a … [Read more...] about Docker Swarm on Play with Docker