sort

set_t *sort(set_t *set){
	
	if(set->head==NULL){
		return set;
	}
	if(set->head->next==NULL){
		return set;
	}
	
	node_t *tmp = set->head;
	node_t *tmp2 = set->head->next;
	
	while(tmp2!=NULL){
		while(tmp2!=tmp){
			
			if(tmp->elem>tmp2->elem){
				swap(tmp,tmp2);
			}
			
			tmp=tmp->next;
		}
		tmp=set->head;
		tmp2=tmp2->next;
	}
	return set;
}