sorting

Operation on Data Structures

by

Design of efficient data structure must take operations to be performed on the data structures into account. The most commonly used operations on data structure are broadly categorized into following types, Create The create operation results in reserving memory for program elements. This can be done by declaration statement. Creation of data structure may take … Read more

Merge Sort Algorithm

by

Merge Sort Algorithm Merge Sort is a Divide and Conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges … Read more