Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
C Array Demonstration
//gcc 5.4.0 // Simple Array Demonstration #include <stdio.h> #include <stdlib.h> typedef struct { int *data; int length; int allocLength; } array; void array_resize (array *arr, int newLength); array array_new (int startLength) { array arr; arr.length = 0; arr.allocLength = startLength; arr.data = malloc(sizeof(int) * startLength); return arr; } void array_push (array *arr, int x) { if(arr->allocLength == arr->length) { array_resize(arr, arr->allocLength * 2); } arr->data[arr->length] = x; ++arr->length; } void array_print (array *arr) { int i; for(i=0; i<arr->length; i++) { printf("[%d] = %d\n", i, arr->data[i]); } } void array_resize (array *arr, int newLength) { arr->data = realloc(arr->data, sizeof(int) * newLength); arr->allocLength = newLength; } int compare_int(int *el1, int *el2) { return *el1 - *el2; } void array_sort(array *arr) { qsort(arr->data, arr->length, sizeof(int), compare_int ); } void array_destroy (array *arr) { free(arr->data); } int main(void) { array myArr = array_new(10); array_push(&myArr, 1); array_push(&myArr, 42); array_push(&myArr, 25); array_push(&myArr, 9); array_push(&myArr, 69); array_print(&myArr); printf("\nLength of array: %d\n", myArr.length); int i = 4; printf("Element [%d] = %d\n", i, myArr.data[i]); printf("\nSorted:\n"); array_sort(&myArr); array_print(&myArr); array_destroy(&myArr); return 0; }
run
|
edit
|
history
|
help
1
SOLUCION EJERCICIO SPOTIFY
A_141211_Tartaglia
Ppp
If Statement/ Decrements V2
Dangling
Welcome1
Static scope
est
sample
menu1.c