sup guys
i need some help
im workin on a couple of problems and im really stuck
can u guys show me how i would the following things? i dont want the C code or anything. just like pseudocode so i understand whats going on and how i would "attack" such a problem
thanx a lot
1. Let U = {u1, u1, ..., un} be the universal set for all possible input sets. Write a function CHARFCN that given a set as input returns the charactericstic function of the set as a sequence.
2. Write a function TRANSPOSE that, given an nXn matrix, returns its transpose
3. Write a program that writes a given permutation as a product of disjoint cycles.
4. Write a program that writes a given permutation as a product of transpositions.
5. Use the program in Execerise 4 as a subroutine in a program that determines whether a given permution is ever or odd.
HELP ON ANY WOULD BE APPRECIATED
thanx
