forked from Biyuktul/sorting_algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2-selection_sort.c
More file actions
55 lines (49 loc) · 1002 Bytes
/
Copy path2-selection_sort.c
File metadata and controls
55 lines (49 loc) · 1002 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include "sort.h"
void swap(int *a, int *b, int *array, size_t size);
/**
* selection_sort - Sorts an array of integers in ascending order using
* the selection sort algorithm.
*
* @array: Pointer to the array to be sorted.
* @size: Size of the array.
*
* Return: None (void).
*/
void selection_sort(int *array, size_t size)
{
size_t i;
size_t j;
size_t min_idx;
for (i = 0; i < size; i++)
{
min_idx = i;
for (j = i; j < size; j++)
{
if (array[j] < array[min_idx])
{
min_idx = j;
}
}
swap(&array[i], &array[min_idx], array, size);
}
}
/**
* swap - Swaps two integers in an array.
*
* @a: Pointer to the first integer to be swapped.
* @b: Pointer to the second integer to be swapped.
* @array: Pointer to the array to be sorted.
* @size: Size of the array.
* Return: None (void).
*/
void swap(int *a, int *b, int *array, size_t size)
{
int temp;
if (*a != *b)
{
temp = *a;
*a = *b;
*b = temp;
print_array(array, size);
}
}