Repository for GSOKite Task
#Questions
Exercise:
-
write a program to determine how many different arrangements there are for the letters a, b, c, d, e, if letters can be repeated.
-
Write a program that will show the output for each arrangement as defined above.
-
Write a binary search routine that returns the first occurrence of the key.
-
If the above is recursive, convert it to non-recursive, or vice-versa.