Java/ArrayTools.java at master · x3matt/Java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
public class ArrayTools {

	public static void fillArray(int arr[],int min,int max){
		for (int i = 0; i < arr.length; i++) {
			arr[i]=min+(int)(Math.random()*(max-min+1));
		}
	}
	public static void printArray(int arr[]) {
		for (int i = 0; i < arr.length; i++) {
			System.out.println(arr[i]);
		}
	System.out.println();
	}
	public static int maxIndexInArray(int arr[]) {
		int maxIndex=0;
		for (int i = 0; i < arr.length; i++) {
			if(arr[i]>arr[maxIndex]){
				maxIndex=i;
			}
		}
		return maxIndex;
	}
	public static int maxInArray(int arr[]) {
		int max=arr[0];
		for (int i = 0; i < arr.length; i++) {
			if(arr[i]>max){
				max=arr[i];
			}
		}
		return max;
	}
	public static int minInArray(int arr[]) {
		int min=arr[0];
		for (int i = 0; i < arr.length; i++) {
			if(arr[i]<min){
				min=arr[i];
			}
		}
		return min;
	}
	public static int minIndexInArray(int arr[]) {
		int minIndex=0;
		for (int i = 0; i < arr.length; i++) {
			if(arr[i]<arr[minIndex]){
				minIndex=i;
			}
		}
		return minIndex;
	}
    public static void bubleSort(int arr[]) {
		for (int i = 0; i < arr.length; i++) {
			 for (int j = 0; j < arr.length; j++) {
				 if(arr[j]>arr[j+1]){
		        	   int temp=arr[j];
		        	   arr[j]=arr[j+1];
		        	   arr[j+1]=temp;
		           }
			}
		}
	}
    public static int minInRange(int arr[],int start) {
    	int min=start;
    	for (int i = start+1; i < arr.length; i++) {
    		if(arr[i]<arr[min]){
    			min=i;
    		}
		}
    	return min;
    }
    public static void selectionSort(int arr[]) {
    	int temp;
    	for (int i = 0; i < arr.length; i++) {
    		int min=minInRange(arr,i);
			temp=arr[i];
			arr[i]=arr[min];
			arr[min]=temp;
		}
    }
	public static int binarySearch(int arr[],int num) {
		int mid;
		for (int l = 0, r=arr.length-1; l <= r;) {
			mid=(l+r)/2;
			if(arr[mid]==num){
				return mid;
			}
		    if(arr[mid]>num){
		    	r=mid-1;
		    }
		    if(arr[mid]<num){
		    	l=mid+1;
		    }
		}
			return -1;
	}
	public static int search(int arr[],int num){
		for(int i=0;i<arr.length;i++){
			if(arr[i]==num){
				return i;
			}
		}
	   return -1 ;
	}
	public static int sumArray(int arr[]){
		int res=0;
		for(int i=0;i<arr.length;i++){
			res=res+arr[i];
		}
	   return res;
	}
}}