The document describes a new sorting algorithm proposed by Akira Kobashi that sorts a series of numbers in a step-by-step process by comparing adjacent elements from both ends and swapping them if out of order, resulting in a faster sorting method than bubble sort. Kobashi experiments with this algorithm by sorting the series "5, 1, 3, 4, 2" in multiple steps and needs to continue experimenting further to validate that the new algorithm is indeed faster.
The document describes a new sorting algorithm proposed by Akira Kobashi that sorts a series of numbers in a step-by-step process by comparing adjacent elements from both ends and swapping them if out of order, resulting in a faster sorting method than bubble sort. Kobashi experiments with this algorithm by sorting the series "5, 1, 3, 4, 2" in multiple steps and needs to continue experimenting further to validate that the new algorithm is indeed faster.
The document describes a new sorting algorithm proposed by Akira Kobashi that sorts a series of numbers in a step-by-step process by comparing adjacent elements from both ends and swapping them if out of order, resulting in a faster sorting method than bubble sort. Kobashi experiments with this algorithm by sorting the series "5, 1, 3, 4, 2" in multiple steps and needs to continue experimenting further to validate that the new algorithm is indeed faster.
5, 1, 3, 4, 2 See the left 2 elements, 5 and 1: 1, 5, 3, 4, 2 Then see the right 2 elements, 4 and 2: 1, 5, 3, 2, 4 Next, see the left 5 and 3 after you confirm the left 1 and 5 were sorted: 1, 3, 5, 2, 4 Then see the right 5 and 2 after you confirm the right 2 and 4 were sorted: 1, 3, 2, 5, 4 After that, see the left 3 and 2 after you confirm the left 1 and 3 were sorted: 1, 2, 3, 5, 4 Finally, see the right 5 and 4: 1, 2, 3, 4, 5 My experiment says this is much faster than bubble sort. I need to keep doing my experiment.