Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package realset;
- /**
- * Document : RealSet
- * Created on : 12/12/2014, 12:21:42
- * Author : talmid
- */
- public class RealSet
- {
- private double [] arr;
- public RealSet(){
- arr = new double[0];
- }
- public int size(){
- return arr.length;
- }
- public void insert(double num){
- boolean isThere = false;
- for (int i = 0; i <arr.length; i++){
- if(num == arr[i]){
- isThere = true;
- break;
- }
- }
- if (!isThere){
- double newarr[] = new double[arr.length+1];
- for (int i = 0; i< arr.length; i++){
- newarr[i] = arr[i];
- }
- newarr[arr.length] = num;
- arr = newarr;
- }
- }
- public void remove(double num){
- boolean isThere = false;
- int a = 0;
- for (int i = 0; i <arr.length; i++){
- if(num == arr[i]){
- a = i;
- isThere = true;
- break;
- }
- }
- if (isThere){
- while (a < arr.length-1){
- double tmp = arr[a];
- arr[a] = arr[a+1];
- arr[a+1] = tmp;
- a++;
- }
- double newarr[] = new double[arr.length-1];
- for(int i = 0; i< arr.length-1; i++){
- newarr[i] = arr[i];
- }
- arr = newarr;
- }
- }
- public double findBiggest(){
- double max = arr[0];
- for (int i = 1; i< arr.length; i++){
- if (arr[i]>max){
- max = arr[i];
- }
- }
- return max;
- }
- public double[] retar(){
- return arr;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement