# Let's sort the Linked List

**Computer Science**Level 2

\[ \text{Step 1: } \, \, \, \, \, \, \, \, \large{ \boxed{64} \rightarrow \boxed{25} \rightarrow \boxed{12} \rightarrow \boxed{22} \rightarrow \boxed{11}} \\ \text{Step 2: } \, \, \, \, \, \, \, \, \large{ \boxed{11} \rightarrow \boxed{64} \rightarrow \boxed{25} \rightarrow \boxed{12} \rightarrow \boxed{22} } \\ \text{Step 3: } \, \, \, \, \, \, \, \, \large{ \boxed{11} \rightarrow \boxed{12} \rightarrow \boxed{64} \rightarrow \boxed{25} \rightarrow \boxed{22} } \\ \text{Step 4: } \, \, \, \, \, \, \, \, \large{ \boxed{11} \rightarrow \boxed{12} \rightarrow \boxed{22} \rightarrow \boxed{64} \rightarrow \boxed{25} } \\ \text{Step 5: } \, \, \, \, \, \, \, \, \large{ \boxed{11} \rightarrow \boxed{12} \rightarrow \boxed{22} \rightarrow \boxed{25} \rightarrow \boxed{64} } \]

Which sorting technique is being used above to sort the *linked list* ?

**Note:** The sorting algorithm being used in this case is most likely to be implemented in something like a linked list, where it is simple to add and remove elements.