Notes

Arrays:

1. WAP to find largest, smallest and 2nd largest
2. WAP to input 10 numbers. Display each number and if the number is even or odd
3. Display if the number is prime or composite
4. Decimal to binary, octal, hexadecimal
5. First n prime numbers entered in array
6. Search the largest and input after the smallest
7. Sort the array using selection sort
8. Sort the array using bubble sort. Apply binary sort to find the position of the element
9. Sort the arrays in ascending order and merge the two arrays only in ascending order
10. Split the array, all odd and all even elements in 2 different arrays. Display the 2 arrays.
11. Given 2 arrays A and B
Transfer the elements of A and B to C in the following order
i. Odd elements of A from L-R to C L-R
ii. Even elements of A from L-R to C R-L
iii. Odd elements of B from L-R to C L-R
iv Even elements of B from L-R to C R-L


Functions
1. Write a function fact(n) to return factorial of n. Use this function to display factorial of 1st n
whole no.s
2. WAF isprime(n) which returns if the number n is prime, 0 otherwise
Use the above function to
i. Display all 2-digit prime no.s and their sum
ii. 1st n prime no.s
iii. Enter n numbers, display sum and average of all primes and that for all composite no.s
3. WAF sumseries(int n) to accept an integer n and return the sum of the series
1/2 + 1/3 + 1/4+... n terms