algorithms is language independent
begin enter Principal amount(Input) enter interest rate(Input) calculate simple interest(Computation/Processing) Display/Show/Print Give sound Simple Interest(output) end By Tomas Naxweka(Namibia)
Online security and directly interact to the customers via chat is new to me when I entered COMODO and in this 11months I really know very well about the needs of it and the interest is still on to know the different levels and updates of it.
Solve simple intress usin fortran
ques : if principle amount is >=10,000 then rate of interest is 20% >=8,000 <=9999 then rate of interest is 18% <+8,000 then rate of interest is 16% Ans: #include<stdio.h> int main() { float si,p,t,r; printf("enter principle amount & time"); scanf("%f%f",&p,&t); if(p>=10000) { r=20; } else if(p>=8,000&&<=9999) { r=18; } else { r=16; } si=(p*t*r)/100; printf("simple interest + %f",si); return(0); }
There is no single algorithm that is ideally suited to every type of sort. If all the data will fit into working memory, then you have a choice of algorithms depending on the size of the set, whether the sort should remain stable or not and how much auxiliary memory you wish to utilise. But if data will not fit into working memory all at once, your choice of algorithm is more limited. Stability relates to elements with equal status. When the sort is stable, equal elements remain in the same order they were originally input while an unstable sort cannot guarantee this. Stable sorts are ideally suited to data that may be sorted by different primary keys, such that the previous sort order is automatically maintained. That is, if data may be sorted by name or by date, sorting by name and then by date keeps the names in the same order (by date). With an unstable sort, even if you keep track of secondary keys there is no guarantee the secondary or tertiary keys will maintain order. For small sets of data that will easily fit into memory, an insertion sort offers the best performance with minimal auxiliary storage. This is a stable sort that can be done in place. For larger sets, a quicksort offers the best performance but is unstable. However, stable versions exist at the cost of performance. Since the algorithm divides the set into smaller and smaller unsorted sets (where each set is in the correct order with respect to the other sets), switching to insertion sort to sort the smaller sets improves overall performance. For disk-based sorting, merge sort is generally the most efficient. It utilises multiple disks and is stable.
Not a very complicated algorithm - all you need to do is to multiply (capital) x (interest rate) x (number of time periods). If the interest rate is expressed in percent, you also need to divide by 100 at some point.
begin enter Principal amount(Input) enter interest rate(Input) calculate simple interest(Computation/Processing) Display/Show/Print Give sound Simple Interest(output) end By Tomas Naxweka(Namibia)
The answer depends on what information you do have.
Not used
To calculate CD interest rate, all you have to do is to just multiply the principal amount you have invested in CD with interest rate. If u want to calculate for the monthly interest then divide the resultant with 12.
1.To calculate the fair market fair rent 2. To Calculate Y.P. for life interest 3. To Capitalize the rent using Y.P. for life interest.
The formula used to calculate your interest is the principle balance, multiplied by the monthly interest rate. Then you mulitply that by the number of months in which you last paid interest.
Banks pay their consumers interest on their money in their accounts because, the same money is what the bank use to lend loans to other customers. As they are going to earn an income through the interest they charge the loan customers, banks give a portion of that interest as interest for the customers who have deposited their money with them.
They loan out the money in their customers' accounts and charge a higher interest rate on the loans.
start accept P ci =A-P A=P+i Print Ci Print C STOP
start input p,n,r as float read si,ci as float
false