# include < iostream >
# include < fstream >
struct Node {
int val;
Node * next ;
};
Node * create_node ( int val) {
Node * new_node = new Node ;
new_node ->val = val;
new_node -> next = nullptr ;
return new_node ;
}
void insert_ordered ( Node *& head , int val) {
Node * new_node = create_node (val);
if (! head || head ->val >= val) {
new_node -> next = head ;
head = new_node ;
} else {
Node * current = head ;
while ( current -> next && current -> next ->val < val) {
current = current -> next ;
}
new_node -> next = current -> next ;
current -> next = new_node ;
}
}
void split_list ( Node * head , Node *& even_head , Node *& odd_head ) {
while ( head ) {
if ( head ->val % 2 == 0 ) {
insert_ordered ( even_head , head ->val);
} else {
insert_ordered ( odd_head , head ->val);
}
head = head -> next ;
}
}
void print_list ( Node * head ) {
while ( head ) {
std :: cout << head ->val << ' ' ;
head = head -> next ;
}
std :: cout << '\n' ;
}
void delete_list ( Node *& head ) {
while ( head ) {
Node * temp = head ;
head = head -> next ;
delete temp ;
}
}
int main () {
std :: ifstream input_file ( "numere.txt" ) ;
int num;
Node * head = nullptr ;
Node * even_head = nullptr ;
Node * odd_head = nullptr ;
while ( input_file >> num) {
insert_ordered ( head , num);
}
split_list ( head , even_head , odd_head );
print_list ( even_head );
print_list ( odd_head );
delete_list ( head );
delete_list ( even_head );
delete_list ( odd_head );
return 0 ;
}