-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathArraySort.java
100 lines (86 loc) · 1.73 KB
/
ArraySort.java
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
import java.util.*;
public class ArraySort {
static int arr[]= new int[]{11,34,77,56,65,55,13,22,19,88};
public static void sortAscDsc() {
int i;
Scanner sc = new Scanner(System.in);
System.out.println("Enter 1 for Ascending\nEnter 2 for Descending");
i = sc.nextInt();
if(i==1) {
sortAscending(arr);
}
else if(i==2) {
sortDescending(arr);
}
else {
System.out.println("Enter valid number");
}
}
public static void insertElement(int arr[] , int pos,int data)
{
for (int i=0;i<arr.length;i++)
{
arr[pos]=data;
}
}
public static void displayArray(int arr[] )
{
for(int i=0;i<arr.length;i++)
{
System.out.print(arr[i]+" ");
}
}
public static void deleteElement(int arr[],int pos)
{
for(int i=0;i<arr.length;i++)
{
if(i==pos)
{
arr[i]=0;
for(int j=pos;j<arr.length-1;j++)
{
arr[j]=arr[j+1];
}
arr[arr.length-1]=0;
}
}
}
public static void sortAscending(int a[])
{
for(int i = 0 ; i < a.length ; i++) {
int tmp = 0 ;
for (int j = i+1 ; j<a.length ; j++) {
if(a[i] > a[j])
{
tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
}
}
public static void sortDescending(int a[])
{
for(int i =0 ;i<a.length;i++)
{
int temp=0;
for(int j = i+1;j<a.length;j++)
{
if(a[i]<a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
}
public static void main(String[] args) {
// insertElement(arr,3,555);
// deleteElement(arr,6);
// sortAscending(arr);
// sortDescending(arr);
sortAscDsc();
displayArray(arr);
}
}