Consider the following list => [40, -5, 45, 55, 1, 60, 15, 95, -85, 5] Each of the following is a view of a sort in progress of the above list. Which sort is which? Explain your answer. [Hint: each sort is used exactly once], Choose between bubble sort, selection sort, and merge sort (1) [-5, 1, 40, 45, 55, -85, 5, 15, 60, 95] Sorting Algorithm is (2) [-5,1, 40, 15, 45, -85, 5, 55, 60, 95] Sorting Algorithm is. ......... (3) [-85, -5, 1, 55, 45, 60, 15, 95, 40, 5] Sorting Algorithm is ........
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
solve it please
Step by step
Solved in 4 steps with 9 images