Java Code to sort an array by exchange method

Problem:

Given a randomly ordered set of n numbers sort them into non-descending order using an exchange method.

Solution:

package array.programs;

import java.util.Scanner;

public class SortByExchange {

int[] array;
int limit;

public static void main(String[] args) {
SortByExchange sortByExchange = new SortByExchange();
sortByExchange.initilizeTheArray();
sortByExchange.doSort();
sortByExchange.printTheArray();
}

public void initilizeTheArray(){
Scanner scanner = new Scanner(System.in);
System.out.println("enter the first array elements limit");
limit = scanner.nextInt();
array = new int[limit];
for (int i = 0; i < array.length; i++) {
System.out.println("enter the element");
array[i] = scanner.nextInt();
}
scanner.close();
}

public void doSort(){
int temp = 0;
for (int i = 0; i < array.length - 1; i++) {
for (int j = i + 1 ; j < array.length; j++) {
if(array[j] < array[i]){
temp = array[j];
array[j] = array[i];
array[i] = temp;
}
}
}
}

public void printTheArray(){
for (int i = 0; i < array.length; i++) {
System.out.print(array[i] + " ");
}
}
}

Output:

enter the first array elements limit
10
enter the element
23
enter the element
4
enter the element
2
enter the element
345
enter the element
32
enter the element
44
enter the element
5555
enter the element
33
enter the element
34
enter the element
555
2 4 23 32 33 34 44 345 555 5555