Can you Bubble sort a Linked List?

Given a linked list with n elements, can you bubble sort it? πŸ˜„

Input

The initial data for the linked list is obtained automatically. You don’t need to do anything.

Output

The program should print the final linked list.

Examples

Input
Output
10 4 8 4 0 -2 8 2 8 0 4
-2 0 0 2 4 4 4 8 8 8
Hint
The challenge here is to implement a swap function on two Node elements in a linked list.
Β 

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in