-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfunction1.java
More file actions
136 lines (104 loc) · 2.65 KB
/
function1.java
File metadata and controls
136 lines (104 loc) · 2.65 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
/*
public class function1 {
public static int sum(int a, int b){
return a+b;
}
public static int sum(int a, int b,int c){
return a+b+c;
}
public static void main (String args[]){
System.out.println(sum(4, 5));
System.err.print(sum(4, 3, 2));
}
}
*/
/* sum of two no using function------------------
public class function1{
public static int sum( int a, int b){
return a+b;
}
public static float sum( float a, float b){
return a+b;
}
public static void main(String[] args) {
System.out.println(sum(5, 6));
System.out.println(sum(3.4f, 4.5f));
}
}
*/
/* prime or not finding--------------------
public class function1 {
public static boolean Isprime(int n){
boolean Isprime = true;
for (int i =2;i<=n-1;i++){
if(n%i==0){
Isprime=false;
}
}
return Isprime;
}
// prime or not------------------
public static boolean Isprime(int n){
//corner case
if(n==2){
return true;
}
boolean Isprime=true;
for(int i=2;i<=Math.sqrt(n);i++){
if(n%i==0){
return false;
}
}
return Isprime;
}
public static void primeRange(int n){
for(int i=2; i<=n;i++){
if( Isprime(i)){
System.out.println(i+" ");
}
}
}
public static void main(String[] args) {
// System.out.println(Isprime(4));
primeRange(100);
}
}
*/
/* binary to decimal...............//
public class function1{
public static void BintoDec(int binNum){
int myNum = binNum;
int pow = 0;
int decNum = 0;
while(binNum>0){
int lastdigit = binNum%10;
decNum = decNum + lastdigit * (int) Math.pow(2, pow);
pow++;
binNum = binNum/10;
}
System.out.println("decimal of"+ myNum +"="+ decNum);
}
public static void main(String args[]){
BintoDec(101);
}
}
*/
/* decimal to binary --------------------//
public class function1{
public static void DectoBin(int decNum){
int myNum = decNum;
int pow = 0;
int binNum = 0;
while(decNum>0){
int rem = decNum%2;
binNum = binNum + rem * (int) Math.pow(10, pow);
pow++;
decNum = decNum/2;
}
System.out.println("binary of"+ myNum +"="+ binNum);
}
public static void main(String args[]){
DectoBin(8);
}
}
*/