Please help me as i'm not able to get a prog. working.
The Qus. is:
Write a predicate sorted :: Ord a => [a] -> Bool which returns True if
the elements of the list appear in increasing order Make sure that the
following inefficient sort program works for short lists:--
sortSpecification x = head [x | x <- perms x, sorted x]
Thanking u
_______________________________________________________________________________
Dhiraj Seth
E-mail:[EMAIL PROTECTED]
Address: 181 West End Ave,
App 111, Binghamton,
NY 13905.
Tel:(607)-766-9390.
_______________________________________________________________________________
