Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #define MAX_SIZE 999
- void bubbleSort(int (*a)[MAX_SIZE], int length) {
- int i, j, t;
- for (i = length - 1; i >= 0; i--) {
- for (j = 1; j <= i; j++) {
- if ((*a)[j-1] > (*a)[j]) {
- t = (*a)[j-1];
- (*a)[j-1] = (*a)[j];
- (*a)[j] = t;
- }
- }
- }
- }
- void swapSort(int (*a)[MAX_SIZE], int length) {
- int i, j, t;
- for (i = 1; i < length; i++) {
- for (j = 0; j < i; j++) {
- if ((*a)[i] > (*a)[j]) {
- t = (*a)[i];
- (*a)[i] = (*a)[j];
- (*a)[j] = t;
- }
- }
- }
- }
- void printArray(int a[MAX_SIZE], int length) {
- int i;
- for (i = 0; i < length; i++) {
- printf("%i\n", a[i]);
- }
- }
- void reverseArray(int (*a)[MAX_SIZE], int length) {
- int i, t;
- for (i = 0; i < length / 2; i++) {
- t = (*a)[i];
- (*a)[i] = (*a)[length - i - 1];
- (*a)[length - i - 1] = t;
- }
- }
- void fPrintArray(int (*a)[MAX_SIZE], int length) {
- FILE *fo;
- fo = fopen("pokazivaci.txt", "w");
- int i;
- for (i = 0; i < length; i++) {
- fprintf(fo, "%i\n", (*a)[i]);
- }
- fclose(fo);
- }
- void pointerArrayTest() {
- const locSize = 98765;
- int *p;
- p = malloc(sizeof(int) * locSize);
- long int i;
- for (i = 0; i <= locSize; i++)
- *(p + i) = i;
- printf("Posljednji clan: %i \n", *(p + i - 1));
- free(p);
- }
- int main()
- {
- int p[MAX_SIZE] = {25, 8, 1994, 1, 0};
- int p_i = 5;
- printf("Niz: \n");
- printArray(p, p_i);
- fPrintArray(p, p_i);
- printf("\n\nRastuci (Bubble Sort): \n");
- bubbleSort(&p, p_i);
- printArray(p, p_i);
- printf("\n\nOpdajuci (Swap Sort): \n");
- swapSort(&p, p_i);
- printArray(p, p_i);
- printf("\n\nReverse: \n");
- reverseArray(&p, p_i);
- printArray(p, p_i);
- //dio sa predavanja, upotreba malloc() i free() funkcije
- printf("\n\nTest: pokazivaci kao nizovi: \n");
- pointerArrayTest();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement