## Program for Merging two Sorted Array

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 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 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

Ram Kripal Array, Data Structure Array, Data Structure 0

If we want to store a group of data together in one place, then an array data structure we should looking for. This data structure enables us to arrange more than one element, that is why it is a termed as a composite data structure. In this data structure, all