Arithmetic(算法)

public class practice {
        class Solution {
            int[] nums = {2, 7, 11, 15};
            int target = 9;
            public int[] twoSum(int[] nums, int target) {
                for (int i = 0; i < nums.length - 1; i++) {
                    for (int j = nums.length - 1; j > i; j--) {
                        if ((target - nums[i]) == nums[j]) {
                            return new int[]{i, j};
                        }
                    }
                }
                throw new IllegalArgumentException("No two sum solution");
            }
        }
    }
    class Math {
        public static void main(String[] args) {
            int[] b = {8, 6, 4, 7, 5, 2, 1, 3, 9};
            //冒泡排序
            /*for (int i = 0; i <b.length-1 ; i++) {
                for (int j = 0; j <b.length-1-i ; j++) {
                    if (b[j]>b[j+1]){
                    int temp =b[j];
                    b[j] =b[j+1];
                    b[j+1]=temp;
                    }
                }
                System.out.println(b[i]);

                }


        }*/
            //选择排序
            /*for (int i = 0; i <b.length ; i++) {
            假定最小的值的位置
                int index =i;
                for (int j = i; j <b.length ; j++) {
                    if (b[index] > b[j]) {
                        index = j;
                    }
                }
                    int temp =b[index];
                    b[index] =b[i];
                    b[i] =temp;
                System.out.println(b[i]);

                }

            }*/
            //使用Arrays类中的sort方法进行排序
             Arrays.sort(b);
            //遍历数组
            for (int i = 0; i <b.length ; i++) {
                System.out.println(b[i]+"\t");

            }

        }

    }