Insertion Sort Java Program Logic

Hey guys in this post, we will discuss the most popular sorting algorithm that is Insertion sort in Java language.

Read more:

class InsertionSort
	/*Function to sort array using insertion sort*/
	void sort(int arr[])
		int n = arr.length;
		for (int i=1; i<n; ++i)
			int key = arr[i];
			int j = i-1;

			/* Move elements of arr[0..i-1], that are
			greater than key, to one position ahead
			of their current position */
			while (j>=0 && arr[j] > key)
				arr[j+1] = arr[j];
				j = j-1;
			arr[j+1] = key;

	/* A utility function to print array of size n*/
	static void printArray(int arr[])
		int n = arr.length;
		for (int i=0; i<n; ++i)
			System.out.print(arr[i] + " ");


	// Driver method
	public static void main(String args[])
		int arr[] = {12, 11, 13, 5, 6};

		InsertionSort ob = new InsertionSort();	 


5 6 11 12 13

That’s it for this post, if you like this post, share this with your friends and colleagues or you can share this within your social media platform. Thanks, I will see you in our next post.

Bushan Sirgur

Hey guys, I am Bushan Sirgur from Banglore, India. Currently, I am working as an Associate project in an IT company.

Leave a Reply