[Dev-C++] greedy and hill climbing

[Pablo I. A. <rig...@ho...>]

Hi, i'm trying to implemet a hill climbing algorithm with a greedy =
initial heuristic for the n queen problem.=20
For the greedy, i wanto to have an array with all the permuted columns.=20
is there any c command for genering permuted arrays?
how can i eliminate a value from that array without searching the =
complete array?

Thank you for the help and i hope that you can undertand my english ;-)

Pablo