Insertion Sort In Data Structure Using C++

on

Data Structure Using C++

Array Data Structure

Sorting

Insertion Sort

void insertionSort(int arr[], int n);
int main(){
 int arr[]={12,11,13,5,6};
 int n=sizeof(arr)/sizeof(arr[0]);
 insertionSort(arr,n);
 for(int i=0;i<n;i++){
  cout<<arr[i]<<"\t";
 }
}
void insertionSort(int arr[], int n)
{
   int i, key, j;
   for (i = 1; i < n; i++)
   {
       key = arr[i];
       j = i-1;
       while (j >= 0 && arr[j] > key)
       {
           arr[j+1] = arr[j];
           j = j-1;
       }
       arr[j+1] = key;
   }
}

Let me know in the comment section if you have any question.

Previous Post:
Bubble Sort In Data Structure Using C++


Comments

Post a Comment