cleanup files

src/selection_sort.c

@@ -12,24 +12,25 @@
  *
  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
-void swap(int *xp, int *yp){
-	int temp = *xp;
-	*xp = *yp;
-	*yp = temp;
-} 
 
+#include "swap.h"
+
+/**
+ * Usar el algoritmo de ordenamentio por selección
+ * @param array El array a ordenar
+ * @param n El tamaño del array
+ */
 void selection_sort(int *array, int n) {
-    int i, j, min_idx;
- 
-    
-    for (i = 0; i < n-1; i++)
-    {
-        min_idx = i;
-        for (j = i+1; j < n; j++)
-          if (array[j] < array[min_idx])
-            min_idx = j;
- 
-        swap(&array[min_idx], &array[i]);
-    }
+	int i;
+	int j;
+	int min_idx;
+	for (i = 0; i < n-1; i++) {
+		min_idx = i;
+		for (j = i + 1; j < n; j++) {
+			if (array[j] < array[min_idx]) {
+				min_idx = j;
+			}
+		}
+		swap(&array[min_idx], &array[i]);
+	}
 }
-