Sort concept's subhierarchy in alphabetic order. Each concept's children in the subhierarchy are ordered alphabetically.
None = sorthier(aConcept);
aConcept - type: con
L("con") = getconcept(findroot(),"top");
getconcept(L("con"),"32");
getconcept(L("con"),"3");
getconcept(L("con"),"33");
# Another layer.
getconcept(L("33"),"c");
getconcept(L("33"),"b");
getconcept(L("33"),"a");
sortchilds(L("con"));
sorthier(L("con"));
Before sorting, the children of "top" are ordered 32, 3, 33.
The children
of 33 are ordered c b a.
After sorting, the order is changed to 3, 32, 33 under top, and a b c under
33.