Question

Consider creating a method minToFront that moves the smallest element to the first node in the list of links in integer values. For example, if the variable list is storing a list of links such as [7, 9, 12, 5, 3, 17], the call to list.minToFront() would be the same as [3, 7, 9, 12, 5, 17]. If there is more than one minimum value, move the first one. If the list is empty, method calls have no effect. The LinkedIntList class is in the form below (using the ListNode class):

public class LinkedIntList t private ListNode front; public class ListNode public int data; public ListNode next

Complete the underlined parts of the code below.

public void minToFront() {

    if (front != null && front.next != null) {

        ListNode current = front;

        ListNode prev = front;

        while (current.next != null) {

            if (current.next.data < prev.next.data) {

                prev = current;

            }

            current = current.next;

        }

        if (prev.next != null && prev.next.data < front.data) {

            _____________________;

            prev.next = prev.next.next;

            min.next = front;

            front = min;

        }

    }

}

Please solve this problem. thank you:)

Answer 1

public void minToFront()

{

if (front!=null && frot.next!=null)

{

ListNode current=front;

ListNode prev=front;

while (current.next!=null)

{

if (current.next.data<prev.next.data)

{

prev=current;

}

current=current.next;

}

if (prev.next!=null && prev.next.data<front.data)

{

ListNode min=Prev.next;

prev.next=prev.next.next;

min.next=front;

front=min;

}

}

}