You can program a non-recursive Fibonacci function in C using a iterative approach with a for loop. Here's a simple and straightforward example: ```c #include void fibonacci(int n) { int t1 = 0, t2 = 1, nextTerm; // Displaying the first two terms printf("Fibonacci Series: %d, %d, ", t1, t2); nextTerm = t1 + t2; for (int i = 3; i <= n; ++i) { printf("%d, ",nextTerm); t1 = t2; // Updating the terms for the next round t2 = nextTerm; nextTerm = t1 + t2; // Calculating the next term } } int main() { int n; printf("Enter the number of terms: "); scanf("%d", &n); fibonacci(n); return 0; } ``` This program first displays the first two terms of the Fibonacci sequence. Then, it enters the loop where `nextTerm` is calculated as the sum of `t1` and `t2`. Then, `t1` and `t2` are updated for the next round and the next term is calculated again. This process continues until it reaches the nth term. The non-recursive nature of the function lies in the loop; instead of calling itself to calculate the next term, it simply uses the previously calculated terms. This way, the program avoids the extra computational effort and possible stack overflows associated with recursive functions. Remember to always include proper error checks and edge cases handling, such as when n is less than 1.