Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- E7.1
- import java.util.Random;
- public class Array
- {
- public static void main(String[] args)
- {
- int[] array = new int[10];
- Random randomGene = new Random();
- System.out.println("Even Number");
- for(int i = 0; i < 9; i ++)
- {
- array[i] = randomGene.nextInt(100);
- if(array[i]%2 == 0)
- {
- System.out.println(array[i]);
- }
- }
- System.out.println("----------------");
- System.out.println("Even Index");
- for(int i = 0; i < 9; i ++)
- {
- if(i%2 == 0)
- {
- System.out.println(array[i] );
- }
- }
- System.out.println("----------------");
- System.out.println("Reverse Order");
- for(int i = 9; i >= 0; i--)
- {
- System.out.println(array[i]);
- }
- System.out.println("----------------");
- System.out.println("First Number");
- System.out.println(array[0]);
- System.out.println("----------------");
- System.out.println("Last Number");
- System.out.println(array[array.length -1] );
- }
- }
- E7.2
- public class ArrayMethods
- {
- private int[] values;
- public ArrayMethods(int[] initialValues)
- {
- values = initialValues;
- }
- public void swapFirstAndLast()
- {
- int temp = values[0];
- values[0] = values[values.length-1];
- values[values.length-1] = temp;
- }
- public void shiftRight()
- {
- int temp = values[values.length - 1];
- for(int i = 0; i < values.length - 1; i++)
- {
- values[i + 1] = values[i];
- }
- values[0] = temp;
- }
- public void evenToZero()
- {
- for(int i = 0; i < values.length; i++)
- {
- if(values[i]%2 == 0)
- {
- values[i] = 0;
- }
- }
- }
- public void elementReplaceEnds()
- {
- for(int i = 1; i < values.length - 1; i++)
- {
- if(values[i] < values[i + 1])
- {
- values[i] = values[i + 1];
- }
- if(values[i] < values[i - 1])
- {
- values[i] = values[i - 1];
- }
- }
- }
- public void middleElementRemoval()
- {
- if(values.length % 2 == 0 )//Even
- {
- int pos = values.length / 2;
- for(int i = pos + 1; i < values.length; i++)
- {
- values[i - 1] = values[i];
- }
- for(int i = pos - 1; i < values.length; i++)
- {
- values[i - 1] = values[i];
- }
- }
- else//Odd
- {
- int temp = values.length - 1;
- int pos = temp / 2;
- for(int i = pos + 1; i < values.length; i++)
- {
- values[i - 1] = values[i];
- }
- }
- }
- public void evenToFront()
- {
- for(int i = 0; i < values.length - 1; i++)
- {
- int temp = values[i];
- if(values[i] % 2 == 0)
- {
- values[i + 1] = values[i];
- }
- values[0] = temp;
- }
- }
- public int secondBiggest()
- {
- int biggest = 0;
- int secondBiggest = 0;
- int pos = 0;
- for(pos = 0; pos < values.length; pos++)
- {
- if(values[pos] > biggest)
- {
- biggest = values[pos];
- }
- }
- for(pos = 0; pos < values.length; pos++)
- {
- if(values[pos] > secondBiggest && values[pos] < biggest)
- {
- secondBiggest = values[pos];
- }
- }
- return secondBiggest;
- }
- public boolean increasingOrder()
- {
- boolean order = false;
- for(int i = 0; i < values.length; i++)
- {
- if(values[i] < values[i + 1])
- {
- order = true;
- }
- else
- {
- order = false;
- }
- }
- return order;
- }
- public boolean adjacentDups()
- {
- boolean dups = false;
- for(int i = 0; i < values.length; i++)
- {
- if(values[i] == values[i + 1])
- {
- dups = true;
- }
- }
- return dups;
- }
- public boolean nonAdjacentDups()
- {
- boolean dups = false;
- for(int i = 0; i < values.length; i++)
- {
- for(int j = 0; j < values.length; j++)
- {
- if(values[j] == values[j + (i + 1)])
- {
- dups = true;
- }
- }
- }
- return dups;
- }
- }
- E7.3
- public class ArrayMethods
- {
- private int[] values;
- public ArrayMethods(int[] initialValues)
- {
- values = initialValues;
- }
- public void swapFirstAndLast()
- {
- int temp = values[0];
- values[0] = values[values.length-1];
- values[values.length-1] = temp;
- }
- public void shiftRight()
- {
- int temp = values[values.length - 1];
- for(int i = 0; i < values.length - 1; i++)
- {
- values[i + 1] = values[i];
- }
- values[0] = temp;
- }
- public void evenToZero()
- {
- for(int i = 0; i < values.length; i++)
- {
- if(values[i]%2 == 0)
- {
- values[i] = 0;
- }
- }
- }
- public void elementReplaceEnds()
- {
- for(int i = 1; i < values.length - 1; i++)
- {
- if(values[i] < values[i + 1])
- {
- values[i] = values[i + 1];
- }
- if(values[i] < values[i - 1])
- {
- values[i] = values[i - 1];
- }
- }
- }
- public void middleElementRemoval()
- {
- if(values.length % 2 == 0 )//Even
- {
- int pos = values.length / 2;
- for(int i = pos + 1; i < values.length; i++)
- {
- values[i - 1] = values[i];
- }
- for(int i = pos - 1; i < values.length; i++)
- {
- values[i - 1] = values[i];
- }
- }
- else//Odd
- {
- int temp = values.length - 1;
- int pos = temp / 2;
- for(int i = pos + 1; i < values.length; i++)
- {
- values[i - 1] = values[i];
- }
- }
- }
- public void evenToFront()
- {
- for(int i = 0; i < values.length - 1; i++)
- {
- int temp = values[i];
- if(values[i] % 2 == 0)
- {
- values[i + 1] = values[i];
- }
- values[0] = temp;
- }
- }
- public int secondBiggest()
- {
- int biggest = 0;
- int secondBiggest = 0;
- int pos = 0;
- for(pos = 0; pos < values.length; pos++)
- {
- if(values[pos] > biggest)
- {
- biggest = values[pos];
- }
- }
- for(pos = 0; pos < values.length; pos++)
- {
- if(values[pos] > secondBiggest && values[pos] < biggest)
- {
- secondBiggest = values[pos];
- }
- }
- return secondBiggest;
- }
- public boolean increasingOrder()
- {
- boolean order = false;
- for(int i = 0; i < values.length; i++)
- {
- if(values[i] < values[i + 1])
- {
- order = true;
- }
- else
- {
- order = false;
- }
- }
- return order;
- }
- public boolean adjacentDups()
- {
- boolean dups = false;
- for(int i = 0; i < values.length; i++)
- {
- if(values[i] == values[i + 1])
- {
- dups = true;
- }
- }
- return dups;
- }
- public boolean nonAdjacentDups()
- {
- boolean dups = false;
- for(int i = 0; i < values.length; i++)
- {
- for(int j = 0; j < values.length; j++)
- {
- if(values[j] == values[j + (i + 1)])
- {
- dups = true;
- }
- }
- }
- return dups;
- }
- }
- E7.4
- public class SumWithoutSmallest {
- public static void main(String[] args) {
- double total = 0;
- double smallest = 0;
- int[] values = new int[10];
- for(int i = 0; i < values.length; i++)
- {
- if( smallest < values[i])
- {
- smallest = values[i];
- }
- total = (total + values[i]) - smallest;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement