Bubble Sort
This is not considered the best sorting method in programming, but it works for our case. Its essence is to compare the tasks in the list in pairs.
It works like this: Put a pencil in front of the first task.
Compare this task with the second.
If the original task is more important, compare it with the third task, then with the fourth, and so on.
If the second task is more important, move the pencil to it and compare it with the tasks below.
Repeat this until you reach the end of the list. The task which is indicated by a pencil at the end is marked as No.1.
In the same way, we can identify the second most important task, then the third, and so on. You should not number all the tasks - 3-7 of the highest priority tasks are enough. It is also not a good idea to use this method for large lists.
