mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-24 22:39:52 +03:00
Code Issues Packages Projects Releases Wiki Activity

used uint8_t instead of int

Browse Source
This commit is contained in:
DhruvPasricha 2021-02-25 17:48:28 +05:30 committed by GitHub
parent c315db948a
commit a4b83a4151
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 11 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
sorting/selection_sort_recursive.c
View File

@ -8,15 +8,16 @@
#include<stdio.h> /// for IO operations #include<stdio.h> /// for IO operations
#include <stdlib.h> /// for dynamic memory allocation #include <stdlib.h> /// for dynamic memory allocation
#include <time.h> /// for random numbers generation #include <time.h> /// for random numbers generation
#include <inttypes.h> /// for uint8_t
/** /**
* @brief Swapped two numbers using pointer * @brief Swapped two numbers using pointer
* @param first pointer of first number * @param first pointer of first number
* @param second pointer of second number * @param second pointer of second number
*/ */
void swap(int *first, int *second) void swap(uint8_t *first, uint8_t *second)
{ {
int temp = *first; uint8_t temp = *first;
*first = *second; *first = *second;
*second = temp; *second = temp;
} }
@ -27,7 +28,7 @@ void swap(int *first, int *second)
* @param size size of array * @param size size of array
* @return min_index index of element having minimum value. * @return min_index index of element having minimum value.
*/ */
int findIndex(const int *arr, const int size) uint8_t findIndex(const uint8_t *arr, const uint8_t size)
{ {
if (size == 1) if (size == 1)
{ {
@ -35,7 +36,7 @@ int findIndex(const int *arr, const int size)
} }
// marking recursive call to reach starting element // marking recursive call to reach starting element
int min_index = findIndex(arr, size - 1); uint8_t min_index = findIndex(arr, size - 1);
if (arr[size - 1] < arr[min_index]) if (arr[size - 1] < arr[min_index])
{ {
@ -51,7 +52,7 @@ int findIndex(const int *arr, const int size)
* @param size size of the array * @param size size of the array
* @returns void * @returns void
*/ */
void selectionSort(int *arr, const int size) void selectionSort(uint8_t *arr, const uint8_t size)
{ {
if (size == 1) if (size == 1)
{ {
@ -59,7 +60,7 @@ void selectionSort(int *arr, const int size)
} }
/* findIndex(arr, size) returned the index having min value*/ /* findIndex(arr, size) returned the index having min value*/
int min_index = findIndex(arr, size); uint8_t min_index = findIndex(arr, size);
/* arr[min_index] is the minimum value in the array*/ /* arr[min_index] is the minimum value in the array*/
if (min_index != 0) if (min_index != 0)
@ -77,16 +78,16 @@ void selectionSort(int *arr, const int size)
*/ */
static void test() static void test()
{ {
const int size = 10; const uint8_t size = 10;
int *arr = (int *)calloc(size, sizeof(int)); uint8_t *arr = (uint8_t *)calloc(size, sizeof(uint8_t));
/* generate size random numbers from 0 to 100 */ /* generate size random numbers from 0 to 100 */
for (int i = 0; i < size; i++) for (uint8_t i = 0; i < size; i++)
{ {
arr[i] = rand() % 100; arr[i] = rand() % 100;
} }
selectionSort(arr, size); selectionSort(arr, size);
for (int i = 0; i < size - 1; ++i) for (uint8_t i = 0; i < size - 1; ++i)
{ {
assert(arr[i] <= arr[i + 1]); assert(arr[i] <= arr[i + 1]);
} }