Sorted? yes? no? how?
Solutions
π΄ C
enum HowSorted{asc,des};
char* isSortedAndHow(int* array, int length)
{
enum HowSorted a;
if(length > 1 && array[0] > array[1])
a = des;
else
a = asc;
for(int i = 1; i < length-1; ++i)
{
if(a==des)
{
if(array[i]<array[i+1])
return "no";
}
else if(a==asc)
{
if(array[i]>array[i+1])
return "no";
}
}
if(a==des)
return "yes, descending";
else
return "yes, ascending";
}Last updated