Wednesday lab

1)Stooge Sort: is a recursive sorting algortihm, which is higly ineffective
(even slower than bubble sort).
The algortihm is :
     * If the value at the end is smaller than the value at the start of
current array, swap them.
     * If there are three or more elements in the current array, then:
           o Stooge sort the initial 2/3 of the array
           o Stooge sort the final 2/3 of the array
           o Stooge sort the initial 2/3 of the array again
     * else: exit the procedure

Write the recursive implementation of stooge sort.(Take the array as input
from the user).

2)Prime-Palindromic: A palindrome is a string that reads the same forward
and backward. An integer is called prime-palindromic if it is possible to
construct a palindrome by concatenating all of its prime factors (without
leading zeros). Each prime factor should be used as many times as its power
in factorization.

48 is prime-palindromic because its prime factors are 2, 2, 2, 2, 3 (2
should be used 4 times, 3 should be used once) and we can obtain the
palindrome 22322.
2261 is prime-palindromic also because its prime factors are 7, 17, and 19,
which can be concatenated to form the palindrome 71917
33 is also not prime-palindromic (its prime factors are 3 and 11).

Write a program which takes a number from user and then calls a function to
extract the prime factors in an array(declare an array of max size 100 and
then initialize them to some dummy value).Now write a recursive function to
form all possible permutations from these factors and then if any of these
permutations is a palindrome then your original number is prime palindromic.
((write recursive function to check palindromes and get permutations)

3)Write a c main function which takes 4 values from user as input:m,n,k,s,
where
m = number of 1 rupee coins allowed
n =  number of 2 rupee coins allowed
k =  number of 5 rupee coins allowed
Write a recursive function which finds the total number of ways in which a
given sum (s) can be reproduced using different 1,2,and 5 rupee coins. You
should print the different configurations also.

Eg: m = 3;n=3;k=2;
s = 10;
1+1+1+2+5
2+2+5+1
5+5
3 ways