Thread: indexOf Linked List

I'm doing the following problem: Write a Java program to find the index of a value in a sorted array. If the value does not find return the index where it would be if it were inserted in order.
My issue here is when I add a value (not already within the list - and after sorting it), I don't get the index of this value. It keeps returning me -1, I do not understand why? what is wrong? Or what am I missing? Any explanations? Help? Thank you

Here is my code :

import java.util.*;
 
public class indexSortedArray {
    public static void main(String[] args) {
 
        try (Scanner input = new Scanner(System.in)) {
            // init array and linked list of array nums
            Integer[] nums = { 1, 2, 4, 5, 6 };
            List<Integer> list = Arrays.asList(nums);
            java.util.LinkedList<Integer> linkedList = new java.util.LinkedList<Integer>(list);
 
            // get user input value
            System.out.print("Value you are looking for? ");
            int value = input.nextInt();
 
            // if value not member of list, add value and sort the list
            if (isMemberLinkedList(linkedList, value) == false) {
                linkedList.add(value);
                Collections.sort(linkedList);
            }
 
            System.out.println("LinkedList of above array "
                    + linkedList); // print linked list
 
            // get value index and print it
            int getIndex = Arrays.asList(nums).indexOf(value);
            System.out.println(value + " is located at " + getIndex + " index"); // -1 if not inside the list
        }
 
    }
 
    // check if value inside linked list
    static boolean isMemberLinkedList(List<?> list, int val) {
        boolean check = false;
        Iterator<Integer> it = (Iterator<Integer>) list.iterator(); // to iterate through the linked list
        // browse linked list
        while (it.hasNext()) {
            if (it.next() == val) {
                check = true;
                // System.out.println("change made");
            }
        }
        return check;
    }
}

On those following lines, I initialize an array and convert it to a list ait Arrays.asList()
From that list, I search for my value within the list and give the index if the value given by the user is already within the list.
If not, we add the value to the list, then sort it, and then give the index.

            Integer[] nums = { 1, 2, 4, 5, 6 };
            List<Integer> list = Arrays.asList(nums);
            java.util.LinkedList<Integer> linkedList = new java.util.LinkedList<Integer>(list);

Concerning the output, here is it for the case when the value is not already a member of the list.

Value you are looking for? 10
LinkedList of above array [1, 2, 4, 5, 6, 10]
10 is located at -1 index

As you can see, it gives me -1 as the index of 10 which is not what I want. I believe, it should give me 5 instead of -1.

Thank you, I just realized the error.
I was getting the index from the previous list (original list) instead of the new sorted list - silly mistake...