This program is straight forward calculation of mean, variance and standard deviation from its formulae directly. It uses mathematical functions for simplicity. Hence reduce the execution length.
Bubble sort is a simple sorting algorithm. It works by repeatedly stepping through the list to be sorted, comparing two items at a time and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort.
The logic contains inportant concepts to note. Lets see at the nested for loop where all the execution is done. The outer for(i Based) keeps track of the number of times the loop is looked after arranging successive elements. From the above, by the algorithm of Bubble sort, the program has go through the loop N number of times to sort N numbers. This is not an advisible algorithm for large data set as the program exexution time becomes extremly high.
The inner For (j based) keeps track of the element that is swapped now. It keeps increasing untill the Limit of N-i-1 is reached. The inside of this For loop is a simple swap program. So our necessary job is done
The following program is also based on array concept. We input the data into an array and then print it using a for loop. Then we take the input of necessary number to search. Now we rotate a loop to compare out KEYNUM with each element of an array. If there is a match then the variable FOUND is assiged an identifier. We use a break statemennt so that as soon as the number is assigned we jump out of loop and print the value. We use this as we didnt use an else statement. So if we are not using a BREAK statement, then the program runs into an infinite loop. The output is printed using an IF statement using the identifier we assing above.
This program is a intro for Array elements. It is a good example for array inputs and execution. The beauty of C language lies in Arrays and pointers. So i stress the readers to concentrate more on programs from here as all are in the order of increasing complexity
The first thing to note is the usage of Symbolic constant MAXSIZE to specify the size of array. If you want to know more about array size and different ways of its specification, Use the search box.
In this program we are initializing all the values to a preset value. By doing so we are manually flusing all the variables. There is a chance that these variables might be assigned some value at some time of execution of other programs. Those will be cleared.
Now we are using a for loop to input the array elements. Here the point to note is the usage of fflush() function, which clears all the input buffers after taking the input. It is advisory that we keep clearing both input and output buffers periodically to aviod any variable over lap.
Then we are reading each element of array and adding using a for loop. We use an else.. if to seperate positive and negative numbers and then add.
This program diplayes all the numbers divisible 5 between a given range. So we set a variable to given first number of range(N1 here) and increment it till end of range(N2 here) and diving every numder coming inside it by 5 with the help of FOR loop. When there is a remainder '0' we will print that number.
This program is an extention of the previous one. We add another extra loop to increment the number isself untill it reaches the limit set of the priniting of prime numbers. This uses the netsed FOR loop concept for execution.
This program checks whether the given number is prime or not. We know that a prime number is not divisible by any natural number other than 1. So if we think a little bit it is the same that if any number till the half of given number is not diving it, It is meant to be a prime. Because if the one factor is greater than half of the given number, then the other factor is less 2, which is not a natural number. Hence it can be termed as prime.
Hence we initialize a variable to 2 and increment it till it reaches half of the given number. If at any time we get a remainder zero, we declare it as not prime, else its accepted as a prime number
This program is completly same as previous program. Same explanation. Insted we use the cosine taylor formula here
Hence we have the series
x2 x4 x6 x8
1 - + - + - ...
2! 4! 6! 8!
Notice that the series only contains even powers of x and even factorials. Even numbers can be represented by 2n. Also notice that this is an alternating series, hence the McLaurin series is
The main point to note is the logic in the program. 121 can be written as 100+20+1.
that is 1*100+2*10+1. This principal is used. So first the number is saved on other variable. Then divided by 10. the remainders are added in the same above way to get the number. Now this number is compared to duplicate copy of original number to check its same or not. If its same we will print it as a palindrome or else the otherwise
This is a straight example. Uses the concepts of even and odd numbers and sum of n numbers together
This uses a Euclid's GCD (and LCM) algorithm. The discription is found here.
http://www.geocities.com/SiliconValley/Garage/3323/aat/a_eucl.html. Its better explained there. There is nothing much to tell about syntax.
This program is to print the fibanocci series. 0 1 1 2 3 5 8 13
The points to note in this program are two variables are preinstianted as the logic of it says that the sum of previous two numbers is the present number. Here there is a good point to note. The COUNT value is initially assigned to 0. but later changed to 2 as after execution, we only need 8 values excluding the initial value instanciated
Another straight forward program which uses a for loop to increment the number. The sum value is pre instiantiated to zero and we use a for loop to increment it. The output is displayed. The other way to execute this program is using the fornula for addition of n natural numbers
This program is a command line calculator. This uses as the input of necessary operation as a string input and uses a case statement to execute the necessary arthematic equation. If a wrong operator is given then the error ms is displayed.
The important points to note in this program are the usage of stdlib and math header files. The use of latter is already mentioned. The first is used because here we have used a abs() funtion which takes the unsigned value of discriminent. The logic is straight. First we calculate discriminant of the equation and check if the roots are real. If they are real, then we calculate normal value, and if not we use the absolute value to calculate the imaginary roots
This is a straight forward program. The logic is the same what we have been studying from childhood.
This is also an easy program. The only thing to note is logic. It checks whether value is above '0' or not and displayes the output
This is also an easy program. The only thing to note is logic. It deivides input number by 2 and declares the result depending on the value of remainder.
This is a pretty straight forward example which uses the basic mathematical formula for calculation. The only new thing to note here is %5.2f which is dealt in previous example.
This program calculates the area of the circle using the classical formula. This program seems straight forward but there are a couple of concepts highlighted here. The first one is the predefined value of PI in preprocessor statements. This declares the value of PI before only. So that it can be used as a keyword temporarily. This thye of constants are called symbolic constants
pow() is the predefined function in math header file. So we have declared it in predefined functions.
The third most imporatnat thing is %5.2f. This thpe of declaration is used for defining the data type of output. This allocates 5 vacant spaces for the whole output obtained from statement. The 2 allocates 2 places for the value after decimal. So only two values are displyed in the output. The 5 places being occupied are 3,2,.,1,7. The main reason of doing so is to stop the memory over flow. This not only saves the execution time but also reduces the memory spaces used. You can think that we can declare the same at starting. If we are doimg so, that memory is allocated form starting only which will be vacant till the program is executed. So its better we create it just before executing as it will save our resources.
This program uses the formula area = square root of (s*(s-a)*(s-b*(s-c)).
Indorer to use execute this we need to use the command sqrt() (square root function) which is predefined in math.h header file. So we are declaring that file in the preprcessor statements. Rest else is straight forward
