Lists of lists of type are suitable for implementing another algorithm. for sorting - sorting with firmware. Suitable for cases where elements
we have to sort, they are not given to us at the beginning, but we get new ones from time to time
elements that must enter the appropriate position between the already sorted elements.
Respond. To do this, when a new element arrives, we find the index of the first element in the loop.
a larger item sorted by it and insert a new item in its place. Work
the basic algorithm is correct, we need to process the first element separately and complete
execution of the program if the number n of elements is 1.

Stages:
▪ Enter the length of the sheet using the keyboard.
▪ Cycle of traversing the sheet and entering data into it, and if the length consists of
one element to complete the program
▪ Loop to traverse the sheet, starting at the second element to find the index
the first is greater than the entered element
▪ If the index found is equal to the length of the list, insert the desired value
▪ Otherwise, insert the desired value instead of the found element.

Please help me, it's important