Code

I find Prime finding & prime checking interesting because it introduces the concept of translating mathematical logic to programming logic. While writing this you also learn by hand how to do little tweaks and improvements to make a program better. After seeing this program, anyone who wishes to learn more should write a program to print all prime numbers from 1-n by adapting the logic used in this program in a loop.

Here’s my approach to this beginner problem. Nested loops are used to format the pyramids print structure. This problem is basically taught to get students used to basic nested loops. #include <stdio.h> int main() { int input; do { printf("ODD input please: "); scanf("%d",&input); } while (input%2==0); int x; for(x=input;x>0;x=x-2) { printf("\t\t\t"); int j=input-x;; while(j>0) { printf(" "); j=j-2; } int i; for(i=x;i>0;i=i-1) { printf("*"); } printf("\n"); } return 0;

Here is my very basic my approach to this problem. This program converts numbers to binary in C using simple basic C concepts. I guess this problem is supposed to teach how to work around a limitation/quirk when programming, and basically encourages to think a bit differently. #include<stdio.h> int main(void) { int input,binary=0,x; //Take and see if input is a positive number do { printf("Please enter POSITIVE a number:"); scanf("%d",&input);}