In C/C+ Programming,

I'm currently practicing learning linked lists and how to go about sorting elements in the linked list while inserting at the same time.

Let's say I have a struct that contains two elements like so:

struct item_type{

char item_name; // You can replace this with any other data type if need be

int item_price // The price to be compared

}

I want to store five items into the cart (linked list) but I want to store these items in order by comparing the item price to be added with the items already in the cart (and their item price[this also includes if the list is empty])

so say I have list item variables like: sushi ($5), beans ($3), caviar($5) , apple ($1), banana, ($1.20)

I would want to insert the 1st item which is apple and compare its price with the rest of the items in the list to determine placement. The order should be ascending. If they both have the same price you can just add the item after.