SelectionSort.c is totally wrong , the logic implemented is different from selection-sort

In C folder , SelectionSort.c , the logic implemented is similar to BubbleSort.c instead of real logic of selection-sort which is the following :
Finding the smallest element in the array , swap it's location with the first element in the array , and doing that until the array is sorted .
But in the following code d7f36262703dea197a1b4f818ff87fbd64db3d3a , they're comparing adjacent elements , j and j+1.

从 C/SelectionSort.c 开始，将其逻辑与 commit d7f36262703dea197a1b4f818ff87fbd64db3d3a 中的 C/BubbleSort.c 进行比较。确认该实现遵循选择排序：选出剩余元素中最小的元素并将其交换到正确位置，然后验证该文件能正确地对具有代表性的数组进行排序。

由索引模型根据 Issue 内容生成。