public/tests/go/solutions/sortlistinsert.go

package solutions

//structures for the linked lists
type NodeI struct {
	Data int
	Next *NodeI
}

func SortListInsert(l *NodeI, data_ref int) *NodeI {
	n := &NodeI{Data: data_ref}
	n.Next = nil

	if l == nil || l.Data >= n.Data {
		n.Next = l
		return n
	}
	temp := l
	for temp.Next != nil && temp.Next.Data < n.Data {
		temp = temp.Next
	}
	n.Next = temp.Next
	temp.Next = n

	return l
}