Question

I need some help doing this Java project.

1.Implement the MySort class with the following operations.

a.bubbleSort(MyArrayList arraylist) – conduct bubble sort on the elements contained in a MyArrayList object.

b.selectionSort(MyArrayList arraylist) – conduct selection sort on the elements contained in a MyArrayList object.

2.Implement the MySearch class with the following operations.

a.binarySearch(MyArrayList arraylist, Comparable target) – conduct binary search on sorted elements contained in a MyArrayList object.

b.linearSearchSorted (MyArrayList arraylist, Comparable target) – conduct linear search on sorted elements contained in a MyArrayList object.

3.Both the MySearch and MySort classes should be created in the collection package.

4.After implementing the MySearch and MySort classes you will test them. To test the MySearch and MySort classes you will create a Lab3 class under the lab package.

5.In the Lab3 class you will create an static void test() method. In this test method you will do the following:

a.Create a numArraylist of MyArrayList type.

b.Generate a sequence of 800 integer numbers in the range [100, 999] using java.util.Random with current system time as the random seed (use java.lang.System.nanoTime()). Insert this sequence of numbers into numArraylistone by one when it is being generated.

c.Sort numArraylist using bubbleSort.

d.Print out numArraylist onto the screen.

e.Prompt user to type in a number through keyboard.

f.Search that number using linearSearchSorted, and print out the returned value onto screen.

g.Call numArraylist.removeRange(50, 650).

h.Then call numArraylist.reverse().

i.Sort numArraylist using selectionSort.

j.Print out numArraylist onto the screen.

k.Prompt user to type in a number through keyboard.

l.Search that number using binarySearch, and print out the returned value onto screen.

Answer 1

`Hey,

Note: If you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

public class MySort{
public static void bubbleSort(MyArrayList arraylist)
{
int n = arraylist.size();
for (int i = 0; i < n-1; i++)
for (int j = 0; j < n-i-1; j++)
if (arraylist[j] > arraylist[j+1])
{
// swap temp and arr[i]
int temp = arraylist[j];
arraylist[j] = arraylist[j+1];
arraylist[j+1] = temp;
}
}
public static void selectionSort(MyArrayList arraylist)
{
int n = arraylist.size();
  
// One by one move boundary of unsorted subarray
for (int i = 0; i < n-1; i++)
{
// Find the minimum element in unsorted array
int min_idx = i;
for (int j = i+1; j < n; j++)
if (arraylist[j] < arraylist[min_idx])
min_idx = j;
  
// Swap the found minimum element with the first
// element
int temp = arraylist[min_idx];
arraylist[min_idx] = arraylist[i];
arraylist[i] = temp;
}
}

}

Note: According to Chegg's policy we are only allowed to answer first part if there are many. So, I request you to post other part as separate posts

Kindly revert for any queries

Thanks.