# include < iostream >
# include < fstream >
struct Node {
int val;
int freq ;
Node * next ;
};
Node * create_node ( int val) {
Node * new_node = new Node ;
new_node ->val = val;
new_node -> freq = 1 ;
new_node -> next = nullptr ;
return new_node ;
}
void insert_or_increment ( Node *& head , int val) {
if (! head || head ->val >= val) {
if ( head && head ->val == val) {
head -> freq ++;
} else {
Node * new_node = create_node (val);
new_node -> next = head ;
head = new_node ;
}
} else {
Node * current = head ;
while ( current -> next && current -> next ->val < val) {
current = current -> next ;
}
if ( current -> next && current -> next ->val == val) {
current -> next -> freq ++;
} else {
Node * new_node = create_node (val);
new_node -> next = current -> next ;
current -> next = new_node ;
}
}
}
void print_greater_than_average ( Node * head , int min_val , int max_val ) {
double average = ( min_val + max_val ) / 2.0 ;
while ( head ) {
if ( head ->val > average ) {
std :: cout << head ->val << " ( freq : " << head -> freq << ")\n" ;
}
head = head -> next ;
}
}
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 ;
int min_val , max_val ;
if ( input_file >> num) {
min_val = max_val = num;
insert_or_increment ( head , num);
while ( input_file >> num) {
insert_or_increment ( head , num);
min_val = std :: min ( min_val , num);
max_val = std :: max ( max_val , num);
}
std :: cout << "Min: " << min_val << "\ nMax : " << max_val << "\n" ;
print_greater_than_average ( head , min_val , max_val );
delete_list ( head );
} else {
std :: cout << "Fișierul este gol sau nu a putut fi citit.\n" ;
}
return 0 ;
}