Sorting a Linked List

1)Say you have an unordered list, and you want to sort it using bubble sort. How many Nodes would you need the memory addresses for to ensure you dont lost any Nodes or lose your place in the list for each comparison and exchange set of actions?

2)In terms of n (the size of the list or array), does bubble sort take a different amount of time if it is executed on a Linked List or an Array?

2)In terms of n (the size of the list or array), is it more cost-effective to use bubble sort on an UnorderedList or to maintain an OrderedList?