Originally Posted by
Ron
Im not sure of what you are saying.
I need to know the method to do Latin squares with 'recursions'. I really hate doing recursions, even though it makes tasks faster.
Please do my work for me.
You already know what a Latin square is. If you read the source kermit gave you, you'd know what permutation is. Permutation is easily made recursive. What is stopping you from opening up your compiler and trying to get these ideas to work in programming?
Code:
#include <stdio.h>
#include <stdlib.h>
static void swap(int *a, int *b) {
/* the code */
}
static void latin_square(int *array, size_t place) {
/* the code */
}
int main(int argc, char *argv[]) {
...