-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEasyCalc.java
More file actions
238 lines (216 loc) · 6.9 KB
/
Copy pathEasyCalc.java
File metadata and controls
238 lines (216 loc) · 6.9 KB
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package assignment_10528808;
/**
*
* @author Mawutor
*/
import javax.swing.JOptionPane;
import java.util.Scanner;
import java.lang.Math;
import java.util.ArrayList;
public class EasyCalc
{
public static double addition(double x,double y)
{
Scanner input=new Scanner(System.in);
System.out.println("Enter the two numbers");
x=input.nextInt();
y=input.nextInt();
double total=x+y;
System.out.printf("The result is %d",total);
return total;
}
public static double subtraction(double x, int y)
{
Scanner input=new Scanner(System.in);
System.out.println("Enter the numbers you want toi subtact from first, then the second");
y=input.nextInt();
x=input.nextInt();
double result=y-x;
System.out.printf("The result is %d",result);
return result;
}
public static double division(int x,int y)
{
Scanner input=new Scanner(System.in);
System.out.println("Enter the numbers you want to divide from first, then the divisor");
x=input.nextInt();
y=input.nextInt();
double result=x/y;
System.out.printf("The result is %d",result);
return result;
}
public static double multiplication(double b,double h)
{
Scanner input=new Scanner(System.in);
System.out.println("Enter the two numbers");
b=input.nextInt();
h=input.nextInt();
double result=h*b;
System.out.printf("The result is %d",result);
return result;
}
public static int modulo(int y,int x)
{
Scanner input = new Scanner (System.in);
System.out.println("Enter the modulo then number ");
y=input.nextInt();
x=input.nextInt();
int result=x%y;
System.out.printf("Modulo %d of %d is %d",y,x,result);
return result;
}
public static int perfectNumbers(int n)
{
Scanner input = new Scanner (System.in);
System.out.println("Enter the number ");
n=input.nextInt();
int arr[]= new int[n];
int sum = 0;
for(int i=1;i<n;i++)
{
int s=n%i;
if(s==0)
{
sum+=i;
}
}
if(sum>n)
{
System.out.println("Its an abunadnt number");
}
else if(sum<n)
{
System.out.println("Its a deficient number");
}
else if(sum==n)
{
System.out.println("Its a perfect number");
}
return n;
}
public static void variance(double mean,double n)
{
Scanner input = new Scanner (System.in);
System.out.println("Enter the total mean devaiton then the number of elements ");
mean=input.nextDouble();
n=input.nextDouble();
System.out.println("1)Population or 2)Sample ");
int ans=input.nextInt();
if(ans==1)
{
double v=(mean*mean)/n;
System.out.printf("result is",v);
}
else if(ans==2)
{
double v=(mean*mean)/n-1;
System.out.printf("result is",v);
}
}
public static void StandardDeviation(double mean,double n)
{
Scanner input = new Scanner (System.in);
System.out.println("Enter the total mean devaiton then the number of elements ");
mean=input.nextDouble();
n=input.nextDouble();
System.out.println("1)Population or 2)Sample ");
int ans=input.nextInt();
if(ans==1)
{
double v=(mean*mean)/n;
v= Math.sqrt(v);
System.out.printf("result is",v);
}
else if(ans==2)
{
double v=(mean*mean)/n-1;
v= Math.sqrt(v);
System.out.printf("result is",v);
}
}
public static void TimeComplexity()
{
Scanner input = new Scanner (System.in);
System.out.printf("1)Bubble Sort Algorithm%n2)Insertion Sort Algorithm%n3)Selection Sort algorithm4)Custom Algorithm");
int f=input.nextInt();
if(f==4)
{
System.out.println("How many loops do you have in youe algorithm");
int opt=input.nextInt();
System.out.println("How many outputs,inputlines and variable declations and assignments do you have inyou algorithm");
int opt2=input.nextInt();
System.out.println("How many nested loops do you have in your algorithm?");
int opt3=input.nextInt();
if(opt>=1 && opt2==0 && opt3==0)
{
System.out.printf("The algorithm increases linearly with the problem ");
}
else if(opt2>=1 && opt>=1 && opt3>=0)
{
System.out.printf("The algorithm increases contantly with the problem ");
}
else if(opt3>=1 && opt>=1 && opt3>=1)
{
System.out.printf("The algorithm increases quadratically with the problem ");
}
}
else if(f==3)
{
System.out.println("Selection Sort increses quadraticlly with the problem");
}
else if(f==2)
{
System.out.println("Insertion Sort increses quadraticlly with the problem");
}
else if(f==1)
{
System.out.println("Bubble Sort increses quadraticlly with the problem");
}
}
public static void main(String[] arg)
{
Scanner input=new Scanner(System.in);
System.out.printf("Which shape%n 1)Addition%n2)Substraction%n3)Division%n4)Time complexity%n5)Standard Deviation%n6)Variance%n7)Perfect Numbers%n8)Modulo%n9)Quit%n>");
int n=input.nextInt();
if(n==1)
{
addition(0,0);
}
else if(n==2)
{
subtraction(0,0);
}
else if(n==3)
{
division(0,0);
}
else if(n==4)
{
TimeComplexity();
}
else if(n==5)
{
StandardDeviation(0,0);
}
else if(n==6)
{
variance(0,0);
}
else if(n==7)
{
perfectNumbers(0);
}
else if(n==8)
{
modulo(0,0);
}
else
{
System.out.println("Thanks for using EasyCalc");
}
}}