Thread: Hello I'm new to java i need help

Implement a function that composes a new list of numbers consisting of elements of two passed lists arranged in ascending order, for example: (( 3, 9, 2, 73, 8, 3, 5 )) - ( 2, 3, 3, 5, 7, 8, 9)

Implement as a function

public static List cinteger > createNewList(List integer) list1, List<Integer> list2)


Do not change the transferred lists. For convenience to implement additional functions:
public static int copy(

List, integer> src. // list from which items are copied

int srcIndex, // position which copied from the src

List<Integer> dst // list which the elements copied in.

int dstIndex. // position from which elements are copied in dst

int count // number of copied elements

public static void sort(ListcInteger) list)

Originally Posted by Norm

What have you tried?
Be sure to wrap any posted code in code tags.

Do you have any specific java programming questions about your assignment?

--_____
This code solve it but its not the right methods
And I don't know any thing about Lists functions
import java.util.*;

class Program {

*** public static void sortedMerge(int a[], int b[], int res[], int n, int m)

*** {

******* Arrays.sort(a);

******* Arrays.sort(b);

******* int i = 0, j = 0, k = 0;

******* while (i < n && j < m) {

*********** if (a[i] <= b[j]) {

*************** res[k] = a[i];

*************** i += 1;

*************** k += 1;

*********** } else {

*************** res[k] = b[j];

*************** j += 1;

*************** k += 1;

*********** }

******* }****

*********

******* while (i < n) {
*********** res[k] = a[i];

*********** i += 1;

*********** k += 1;

******* }****

******* while (j < m) {*
*********** res[k] = b[j];

*********** j += 1;

*********** k += 1;

******* }

*** }
*** public static void main(String[] args)*

*** {

******* int a[] = { 3, 9, 2, 7};

******* int b[] = { 8, 3, 5 };

******* int n = a.length;

******* int m = b.length;

******* int res[] = new int[n + m];

******* sortedMerge(a, b, res, n, m);

******* System.out.print( "Sorted merged list :");

******* for (int i = 0; i < n + m; i++)

*********** System.out.print(" " + res[i]);***

*** }
}