โœฆ

Anna Grigoryan

ENGS110 ยท Spring 2026
โ† Back to main page
๐Ÿ“ Functions
๐Ÿ“„
sum .c โ–ถ
#include <stdio.h>
#include <stdlib.h>
int f(int* arr, int n, int* r){
    int sum = 0;
    int min = arr[0];
    for (int i = 0; i < n; i++){
        sum += arr[i];
        if (arr[i] < min){
            min = arr[i];
        }
    }
    *r = min;
    return sum;
}
int main(){
    int n;
    printf("array size");
    scanf("%d", &n);
    int* p = malloc(n*sizeof(int));
    printf("enter array elements");
    for(int i = 0; i < n; i++){
        scanf("%d", &p[i]);
    }
    int min;
    int a = f(p, n, &min);
    printf("the sum is %d\n", a);
    printf("the minimum is %d", min);
    free(p);
    return 0;
}
๐Ÿ“„
swap_pointers .c โ–ถ
#include <stdio.h>
// a basic swap function using pointers
void swap(int* a, int* b) {
    int temp = *a;
    *a = *b;
    *b = temp;
}
int main(void) {
    int a, b;
    printf("enter values for a and b: ");
    scanf("%d %d", &a, &b);
    printf("before swapping: a=%d, b=%d\n", a, b);
    swap(&a, &b);
    printf("after swapping: a=%d, b=%d\n", a, b);
    return 0;
}