mirror of
https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git
synced 2023-10-11 15:56:24 +08:00
76 lines
2.0 KiB
C
76 lines
2.0 KiB
C
|
/*
|
||
|
|
* CArray.h
|
||
|
|
*
|
||
|
|
* Author: Leonardo Vencovsky
|
||
|
|
* Created on 18/03/2018
|
||
|
|
*
|
||
|
|
* Modified by: Leonardo Vencovsky
|
||
|
|
* Last modified: 19/03/2018
|
||
|
|
*
|
||
|
|
* Header for Array in C
|
||
|
|
*
|
||
|
|
* Compiled in Visual Studio 2017
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
extern "C" {
|
||
|
|
#endif
|
||
|
|
|
||
|
|
typedef struct CArray {
|
||
|
|
int *array;
|
||
|
|
int size;
|
||
|
|
} CArray;
|
||
|
|
|
||
|
|
// +-------------------------------------+
|
||
|
|
// | Returns array |
|
||
|
|
// +-------------------------------------+
|
||
|
|
CArray * getCArray(int size);
|
||
|
|
CArray * getCopyCArray(CArray *array);
|
||
|
|
|
||
|
|
// +-------------------------------------+
|
||
|
|
// | Input / Output |
|
||
|
|
// +-------------------------------------+
|
||
|
|
int insertValueCArray(CArray *array, int position, int value);
|
||
|
|
int removeValueCArray(CArray *array, int position);
|
||
|
|
int pushValueCArray(CArray *array, int value);
|
||
|
|
int updateValueCArray(CArray *array, int position, int value);
|
||
|
|
|
||
|
|
// +-------------------------------------+
|
||
|
|
// | Erase |
|
||
|
|
// +-------------------------------------+
|
||
|
|
int eraseCArray(CArray *array);
|
||
|
|
|
||
|
|
// +-------------------------------------+
|
||
|
|
// | Switching |
|
||
|
|
// +-------------------------------------+
|
||
|
|
int switchValuesCArray(CArray *array, int position1, int position2);
|
||
|
|
int reverseCArray(CArray *array);
|
||
|
|
|
||
|
|
// +-------------------------------------+
|
||
|
|
// | Sorting |
|
||
|
|
// +-------------------------------------+
|
||
|
|
int bubbleSortCArray(CArray *array);
|
||
|
|
int selectionSortCArray(CArray *array);
|
||
|
|
int insertionSortCArray(CArray *array);
|
||
|
|
int blenderCArray(CArray *array);
|
||
|
|
|
||
|
|
// +-------------------------------------+
|
||
|
|
// | Searching |
|
||
|
|
// +-------------------------------------+
|
||
|
|
int valueOcurranceCArray(CArray *array, int value);
|
||
|
|
CArray * valuePositionsCArray(CArray *array, int value);
|
||
|
|
int findMaxCArray(CArray *array);
|
||
|
|
int findMinCArray(CArray *array);
|
||
|
|
|
||
|
|
// +-------------------------------------+
|
||
|
|
// | Display |
|
||
|
|
// +-------------------------------------+
|
||
|
|
int displayCArray(CArray *array);
|
||
|
|
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
}
|
||
|
|
#endif
|