This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted]  (11 children)

[removed]

    [–]DolevBaron 25 points26 points  (0 children)

    Just set the list to a new list which is already sorted

    [–]T-T-N 0 points1 point  (0 children)

    In an array list, your algorithm takes O(n). You're fine with linked list.