mirror of
https://github.com/TheAlgorithms/C
synced 2024-11-22 13:31:21 +03:00
86 lines
2.3 KiB
C
86 lines
2.3 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
|
|
|
|
#define ARRAY_ERASED -1
|
|
#define SUCCESS 0
|
|
#define INVALID_POSITION 1
|
|
#define POSITION_INIT 2
|
|
#define POSITION_NOT_INIT 3
|
|
#define POSITION_EMPTY 4
|
|
#define ARRAY_FULL 5
|
|
|
|
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
|