Sort Ascending array
Array -- Sort Ascending
Write a return method that can sort an int array in Ascending order without using the sort method of the Arrays class
Solution 1:
public static void main(String[] args) {
ArrayList<Integer> arr = new ArrayList<Integer>(5);
arr.add(12);arr.add(4);arr.add(6);arr.add(8);arr.add(20);
System.out.println(findMin(arr));
public static int[] Sort(int[] a) {
ArrayList<Integer> list=new ArrayList<Integer>();
for(int each: a)
list.add(each);
for(int i=0; i < a.length; i++) {
a[i] = findMin(list);
list.remove(Integer.valueOf(a[i]));
}
return a;
}
public static int findMin(ArrayList<Integer> a) {
int min =Integer.MAX_VALUE;
for(int each: a)
min = Math.min(min, each);
return min;
}
Solution 2:
public static void SortingArrayAsc(int[] arr) {
ArrayList<Integer> list = new ArrayList();
for(int each: arr) {
list.add(each);
}
for (int i = 0; i < list.size(); i++) {
for (int j = 0; j < list.size(); j++) {
if (list.get(i) < list.get(j)) {
Integer temp = list.get(i);
list.set(i, list.get(j));
list.set(j, temp);
}
}
}
for(int i=0; i < list.size(); i++) {
arr[i] = list.get(i);
}