Search for a command to run...
Series
Data Structures and Algorithms Educational and Technical Articles.
Linked Lists A linked List is a container where data is stored in nodes consisting of a single data item and a reference to the next node. The concept of linking together simple nodes into a complex structure is the basis of many types of data stru...
Stack A last in, first out (LIFO) data container. Primary Stack Operations The primary functions used to manipulate a stack are push and pop. Function push creates a new node and places it on top of the stack. Function pop removes a node from the t...
What is Sorting? Sorting is an algorithm that arranges the elements of a list in a certain order [either ascending or descending]. The output is a permutation or reordering of the input. Why is Sorting Necessary? Sorting is one of the important categ...
Algorithm Bubble sort is the simplest sorting algorithm. It works by iterating the input array from the first element to the last, comparing each pair of elements and swapping them if needed. Bubble sort continues its iterations until no more swaps a...
Selection Sort Selection sort is an in-place sorting algorithm. Selection sort works well for small files. It is used for sorting the files with very large values and small keys. This is because selection is made based on keys and swaps are made only...
Insertion Sort Insertion sort is a simple and efficient comparison sort. In this algorithm, each iteration removes an element from the input data and inserts it into the correct position in the list being sorted. The choice of the element being remov...