This complexity is related to execution time of the algorithm.
It depends on the number of element (item) comparisons and number of element movement (movement of data from one place to another).
However, the complexity of the most of the algorithms described here related to the number of element comparisons.
That means, the complexity of the algorithm is computed with respect to the total number of element (item) comparisons needed for the algorithm
Preview <<<<<<
skip to main |
skip to sidebar
Programming Sample Code, Source Code, Example Codes
About Site
printf(" Welcome.
C programmer is sample source code search engine. Do you need sample source code ? Do you search program code ? Do you want find example code ? Do you want learning coding ? Everything is here. You can get code. You can search code, application sample, code project. Various programming languages code examples, sample source codes is here. This Site also Provide Help C/c++ Language Developed. ")
If need to be any Kind of email Us cprogrammerbd@gmail.com.
Menu
-
▼
09
(57)
-
▼
Dec
(18)
- Find Out the summation Of the boundary elements Of...
- Location of an element
- Two dimensional array representation in memory
- Two Dimensional Array
- Insert The Element Into The Array At A Given Position
- Find out the summations of even and odd numbers
- To find out largest element
- One Dimensional Array
- Definition of an array
- Space complexity
- Time complexity
- Importance of data structure
- program
- Algorithm
- BackgRound2
- BackgRound
- Data Structures Fundamentals
-
▼
Dec
(18)
#include stdio #include conio int main() { int i,j,n; printf("Enter Number Of Terms:"); scanf("%d",&n); printf("Prime Numbers Are Follwing "); for(i=2;i<=n;i++) { for(j=2;j<=i;j++) { if(i%j==0) break; } if(i==j) printf("%d",i); } return 0; } Any more about prime number
No comments:
Post a Comment