# Tag - selection sort algorithm

## A Programmer’s approach of looking at Array vs. Linked List

A Programmer’s approach of looking at Array vs. Linked List - Linked List - In general, array is considered a data structure for which size

## C++ programming Articulation Points (or Cut Vertices) in a Graph

C++ programming Articulation Points (or Cut Vertices) in a Graph - Articulation points represent vulnerabilities in a connected network

## Insertion Sort for Singly Linked List

Insertion Sort for Singly Linked List - Searching and sorting - We have discussed Insertion Sort for arrays.In this article linked list is also discussed.

## Binary Insertion Sort

Binary Insertion Sort - Searching and Sorting - We can use binary search to reduce the number of comparisons in normal insertion sort. Binary Insertion Sort...

## JAVA programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x

JAVA programming - Given a sorted array and a number x, find the pair in array whose sum is closest to x - Searching and sorting - Given a sorted array and a...

## C++ programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x

C++ programming - Given a sorted array and a number x, find the pair in array whose sum is closest to x - Searching and sorting - Given a sorted array and a...

## C programming – Given a sorted array and a number x, find the pair in array whose sum is closest to x

C programming - Given a sorted array and a number x, find the pair in array whose sum is closest to x - Searching and sorting.- Given a sorted array. find a...

## Search in an almost sorted array

Search in an almost sorted array - Searching and Sorting - A simple solution is linearly search given key in given array.Time complexity of solution is O(n).We...

## Sort a nearly sorted (or K sorted) array

Sort a nearly sorted (K sorted) array - Searching and sorting - Given an array of n elements, where each element is at most k away from its target position.

## Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted

Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted -Searching and sorting - Given an unsorted array arr[] of size n. find...