-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpolynomial.java
135 lines (101 loc) · 3.51 KB
/
polynomial.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
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
import java.util.*;
class demo2{
public static void main(String[] args){
int x,ch;
Scanner sc = new Scanner(System.in);
Polynomial p = new Polynomial();
LinkedList<Integer> list = new LinkedList<Integer>();
while(true){
System.out.println("ENTER");
System.out.println("1.create polynomial");
System.out.println("2.print polynomial");
System.out.println("3.addition");
System.out.println("4.multiplication");
System.out.println("5.exit");
ch = sc.nextInt();
switch(ch){
case 1:
System.out.println("ENTER DEGREE OF POLYNOMIAL :");
x = sc.nextInt();
list = p.createPoly(x);
break;
case 2:
p.displayPoly(list);
break;
case 3:
list = p.addPoly();
break;
case 4:
list = p.mutiplyPoly();
break;
case 5:
System.exit(0);
break;
default:
System.out.println("Done");
}
}
}
}
class Polynomial{
LinkedList<Integer> createPoly(int x){
LinkedList<Integer> list = new LinkedList<Integer>();
Scanner sc = new Scanner(System.in);
do{
System.out.println("ENTER COEFFICIENT FOR POWER "+x--+" : ");
list.add(sc.nextInt());
}while(x>=0);
return list;
}
LinkedList<Integer> addPoly(){
int max,m,n,k=0;
LinkedList<Integer> a = new LinkedList<Integer>();
LinkedList<Integer> b = new LinkedList<Integer>();
LinkedList<Integer> list = new LinkedList<Integer>();
Scanner sc = new Scanner(System.in);
System.out.println("ENTER DEGREE OF POLYNOMIAL :");
m = sc.nextInt();
a = createPoly(m);
System.out.println("ENTER DEGREE OF POLYNOMIAL :");
n = sc.nextInt();
b = createPoly(n);
max = (m>=n)? m:n;
k=max;
for (int i = 0 ; i <= max ; i++)
list.add(0);
while(m>=0 && n>=0){
list.set(k--,a.get(m--)+b.get(n--));
}
while(m>=0) list.set(k--,a.get(m--));
while(n>=0) list.set(k--,b.get(n--));
displayPoly(list);
return list;
}
LinkedList<Integer> mutiplyPoly(){
int max,m,n;
LinkedList<Integer> a = new LinkedList<Integer>();
LinkedList<Integer> b = new LinkedList<Integer>();
LinkedList<Integer> list = new LinkedList<Integer>();
Scanner sc = new Scanner(System.in);
System.out.println("Enter degree of polynomial");
m = sc.nextInt();
a = createPoly(m);
System.out.println("Enter degree of polynomial");
n = sc.nextInt();
b = createPoly(n);
for (int i = 0 ; i < a.size() + b.size()-1 ; i++)
list.add(0);
for (int i = 0; i < a.size(); i++)
for (int j = 0; j < b.size(); j++)
list.set(i+j, ((a.get(i) * b.get(j))+list.get(i+j)));
displayPoly(list);
return list;
}
void displayPoly(LinkedList<Integer> a){
int p = a.size()-1,i=0;
do{
System.out.print(a.get(i++)+"X^"+p--+" ");
}while(p>=0);
System.out.println("");
}
}