Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Complex Number implementation using oops java
/*package whatever //do not write package name here */ import java.io.*; import java.util.*; import java.lang.*; class ComplexNumber{ private int real; private int img; public ComplexNumber(int real,int img) { this.real=real; this.img=img; } public int getImaginary() { return img; } public int getReal() { return real; } public void setReal(int r) { this.real=r; } public void setImaginary(int i) { this.img=i; } public void print() { if(img==0) { System.out.println(real); } else { if(img>0) System.out.println(real+" + i"+img); else System.out.println(real+" - i"+(-1)*(img)); } } public void addComplex(ComplexNumber c2) { this.real=this.real+c2.real; this.img=this.img+c2.img; } public static ComplexNumber add(ComplexNumber c1,ComplexNumber c2) { int x=c1.real+c2.real; int y=c1.img+c2.img; ComplexNumber c=new ComplexNumber(x,y); return c; } public void multiply(ComplexNumber c) { int x=this.real; int y=this.img; int a=c.real; int b=c.img; int r=x*a-y*b; int i=y*b+a*x; this.real=r; this.img=i; } public static ComplexNumber conjugate(ComplexNumber c) { int r=c.real; int i=c.img; i=(-1)*i; ComplexNumber c1=new ComplexNumber(r,i); return c1; } } class Rextester { public static void main (String[] args) { ComplexNumber c1=new ComplexNumber(2,3); c1.print(); c1.setReal(10); c1.setImaginary(30); c1.print(); ComplexNumber c2=new ComplexNumber(20,50); c1.addComplex(c2); c1.print(); ComplexNumber c3=new ComplexNumber(2,2); c1.multiply(c3); c1.print(); ComplexNumber c4=ComplexNumber.add(c2,c3); c4.print(); ComplexNumber c5=ComplexNumber.conjugate(c4); c5.print(); } }
run
|
edit
|
history
|
help
0
Basic tree implementation
To check whether a given number is smith number or not
Queue implementation
String Palindrome
JavaQ5
Copy an array elments into another array
HelloUser
// Java Coding Challenge - 07: Print out Fibonacci number 0 - 1000
Day 2
3rd