fork download
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. struct lelem
  6. {
  7. int data;
  8. lelem *next;
  9. };
  10.  
  11. void print(lelem *head)
  12. {
  13. lelem *pelem=head;
  14. while (pelem!=0)
  15. {
  16. cout << pelem->data << endl;
  17. pelem=pelem->next;
  18. }
  19. cout << "\n"<<endl;
  20. }
  21.  
  22. void insert_sorted(lelem*& head, int d)
  23. {
  24. lelem** current = &head;
  25.  
  26. while (*current != nullptr && (*current)->data < d)
  27. {
  28. current = &(*current)->next; // zum Zeiger auf das übernächste Element gehen
  29. }
  30. *current = new lelem{d, *current};
  31. }
  32.  
  33. int main()
  34. {
  35. lelem*head=NULL;
  36.  
  37. cout << "Testen von insert_sorted:\n"<<endl;
  38.  
  39. insert_sorted(head,5);
  40. insert_sorted(head,7);
  41. insert_sorted(head,3);
  42. insert_sorted(head,9);
  43. insert_sorted(head,10);
  44. print(head);
  45.  
  46.  
  47. return 0;
  48. }
Success #stdin #stdout 0s 16064KB
stdin
Standard input is empty
stdout
Testen von insert_sorted:

3
5
7
9
10