Question

Using java

Part A

Make a list of random items in your nodes.

(Simple nodes with item an int)

Print out this list.

Write a method to put this list in order, either smallest

to largest or largest to smallest (item)

Print of the list

Part B.

Make a list of the modified Bicycle nodes (added age and gender to the Bicycle class) // did it

Print out the list with the name, age and gender for each node. //did it

Write a method to find the oldest owner and print out the name, age and gender of this owner.//(idk how to do)

Answer 1

Part A)

CODE

========================

import java.util.ArrayList;

import java.util.Collections;

import java.util.Comparator;

import java.util.List;

import java.util.Random;

public class Node implements Comparator<Node>{

   int item;

   public Node(int item) {

       this.item = item;

   }

  

   public Node() {}

   @Override

   public int compare(Node o1, Node o2) {

       if(o1.item == o2.item)

           return 0;

       else if(o1.item > o2.item)

           return 1;

       return -1;

   }

  

   public static void main(String args[]) {

       List<Node> nodes = new ArrayList<>();

       Random rand = new Random();

       for(int i=0; i<10; i++) {

           int n = rand.nextInt(100);

           nodes.add(new Node(n));

       }

       System.out.println("The original list is: ");

       for(int i=0; i<10;i++) {

           System.out.print(nodes.get(i).item + " ");

       }

      

       Collections.sort(nodes, new Node());

       System.out.println("\nThe sorted list is: ");

       for(int i=0; i<10;i++) {

           System.out.print(nodes.get(i).item + " ");

       }

   }

}

OUTPUT

========================

terminated> Node [Java Application] /Library/Java/JavaVi The original list is: 75 79 59 60 57 23 33 67 25 89 The sorted list is: 23 25 33 57 59 60 67 7579 89

Part B)

CODE

==========================

public class BicycleNode{

   int age;

   String gender, name;

   public BicycleNode(int age, String gender, String name) {

       super();

       this.age = age;

       this.gender = gender;

       this.name = name;

   }

   /* (non-Javadoc)

   * @see java.lang.Object#toString()

   */

   @Override

   public String toString() {

       return "BicycleNode [age=" + age + ", gender=" + gender + ", name=" + name + "]";

   }

   public static void findOldestOwner(BicycleNode nodes[]) {

       if(nodes.length > 0) {

           int maxAge = nodes[0].age;

           BicycleNode node = nodes[0];

           for(int i=1; i<5; i++) {

               if(maxAge < nodes[i].age) {

                   maxAge = nodes[i].age;

                   node = nodes[i];

               }

           }

           System.out.println("\n\nThe oldest owner details are: ");

           System.out.println(node);

       }

   }

   public static void main(String args[]) {

       BicycleNode[] nodes = new BicycleNode[5];

       nodes[0] = new BicycleNode(45, "Name1", "Male");

       nodes[1] = new BicycleNode(56, "Name2", "Female");

       nodes[2] = new BicycleNode(42, "Name3", "Male");

       nodes[3] = new BicycleNode(31, "Name4", "Female");

       nodes[4] = new BicycleNode(78, "Name5", "Female");

       System.out.println("The bicyles are: ");

       for(int i=0; i<5; i++) {

           System.out.println(nodes[i]);

       }

      

       findOldestOwner(nodes);

   }

}

OUTPUT

==========================

The bicyles are: BicycleNode [age-45, gender-Name1, name-Male] BicycleNode [age-56, gender-Name2, name-Female] BicycleNode [age-42, gender-Name3, name-Male] BicycleNode [age-31, gender-Name4, name-Female] BicycleNode [age-78, gender-Name5, name-Female] The oldest owner det BicycleNode [age-78, gender-Name5, name-Female] alls are