Logic for Prime Number Lecture by Mr. Dhanesh Gupta.
A natural number greater than one has not any other divisors except 1 and itself. In other word we can say which has only two divisors 1 and number itself. For …
Faculty: LAW BA LLB II Year(IV Sememester) Model Papers Sr. No. Paper Name Question Paper Link
Faculty: LAW BA LLB III Year(V Sememester) Model Papers Sr. No. Paper Name Question Paper Link
Faculty: Law B.A. LL.B VIII Semester Model Papers Sr. No. Paper Name Question Paper Link 1 # Click Here
A natural number greater than one has not any other divisors except 1 and itself. In other word we can say which has only two divisors 1 and number itself. For …
A natural number greater than one has not any other divisors except 1 and itself. In other word we can say which has only two divisors 1 and number itself. For example: 5
Their divisors are 1 and 5.
Logic for prime number in c
We will take a loop and divide number from 2 to less than number. If the number is not divisible by any of the numbers then we will print it as prime number.
This is a part of lecture presented by Ms.Rashmi Sharma Asst. professor of Biyani Girls College. This video is about Selection Sort. This algorithm sorts the data in ascending order. In …
This is a part of lecture presented by Ms.Rashmi Sharma Asst. professor of Biyani Girls College. This video is about Selection Sort. This algorithm sorts the data in ascending order. In Selection sort element at position 0 compared with all other element in the array. If the element found greater from other element then interchanged. The video is helpful for BCA, MCA, M.Sc. (IT) Students.
