Selection Sort Java Program Logic

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

Read more:

class SelectionSort
	void sort(int arr[])
		int n = arr.length;

		// One by one move boundary of unsorted subarray
		for (int i = 0; i < n-1; i++)
			// Find the minimum element in unsorted array
			int min_idx = i;
			for (int j = i+1; j < n; j++)
				if (arr[j] < arr[min_idx])
					min_idx = j;

			// Swap the found minimum element with the first
			// element
			int temp = arr[min_idx];
			arr[min_idx] = arr[i];
			arr[i] = temp;

	// Prints the array
	void printArray(int arr[])
		int n = arr.length;
		for (int i=0; i<n; ++i)
			System.out.print(arr[i]+" ");

	// Driver code to test above
	public static void main(String args[])
		SelectionSort ob = new SelectionSort();
		int arr[] = {64,25,12,22,11};
		System.out.println("Sorted array");


Sorted array
11 12 22 25 64 

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