## Bubble Sort Algorithm

Bubble sort is the simplest sorting algorithm. It works by iterating the input array from the first element to last. We compare each pairs of elements and swapping them if they are in wrong order.

Mr. Ram Kripal Mishra is an Assistant Professor at the Department of Computer Application, Kanpur Institute of Technology, Kanpur. His research interest is in the area of Machine Learning and Computer Vision.

Ram Kripal Algorithm Algorithm, Sorting 0

Bubble sort is the simplest sorting algorithm. It works by iterating the input array from the first element to last. We compare each pairs of elements and swapping them if they are in wrong order.

Ram Kripal Algorithm Algorithm 0

The word algorithm is come from the name of a Persian author, Abu Ja’far Mohammed Ibn Musa al Khowarizmi, who wrote a text book on mathematics. This word Algorithm has a special significance

Ram Kripal Algorithm Algorithm, Sorting 0

Selection Sort is an in-place sorting algorithm. The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.

Ram Kripal Algorithm Algorithm, Recursion 0

The Tower of Hanoi (also called the Tower of Brahma or Lucas’ Tower) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod.

Ram Kripal Array, Data Structure Array, Data Structure 0

If there are two sorted arrays, then process of combining these sorted array into another sorted array is called merging. Let us take one example. Let us suppose \(arr_1\) and \(arr_2\) are two sorted array,

Ram Kripal Machine Learning Machine Learning 0

If we show a picture to a three year old child and ask her is there a tree in the picture, it is almost certain that we will get the right answer. if we ask a thirty year person what the definition of a tree is,

Ram Kripal Array, Data Structure Array, Data Structure 0

The prerequisite for binary search is that the array should be sorted. Firstly we compare the item to be searched with the middle element of the array. If the item is found there, our search finishes successfully

Ram Kripal Array, Data Structure Array, Data Structure 0

Simplest method for searching an element in an array is sequential search or linear search. It is performed in a linear way i.e. start from the beginning of the array and continue till we find the item

Ram Kripal Array, Data Structure Array, Data Structure 0

So far in this post we introduce array data structure and in this post discussed one-dimensional array. In this post we discuss Matrix(two dimensional array) which is an example of

Ram Kripal Array, Data Structure Array, Data Structure 0

In the previous post we introduce the array data structure. In this post we introduce one dimensional array. If only one subscript is required to reference all the element of the array, then the array is termed as