Amrita Vishwa Vidyapeetham students are generally known for their impeccable discipline. However, at times in the canteen, they tend to behave recklessly by cutting in line and joining their friends who belong to the same section. It's quite a spectacle to see!

1a. Your task is to write a program that simulates such a queue. Assume the queue contains the last 3 digits of the roll numbers of students as its elements.

The cashier at the canteen realizes this behavior of students and asks a student named Arjun to note down the roll numbers (last 3 digits only) of students standing in the queue.

1b. Your task is to write a program that simulates a list of students where the order of the student's section is the same as they are standing in the queue. However, the roll numbers of students belonging to the same section should be listed in ascending order.

Arjun realizes that students need to return to their classrooms quickly to attend classes and decides to choose the best-suited sorting algorithm with the best possible time complexity.

1c. Your task is to guess the sorting algorithm chosen by Arjun and write a program that can sort the list of roll numbers using that sorting algorithm. Assume that a maximum of 420 students are standing in the queue, and the roll numbers range from 001 to 700.