Question

I have a program which places structures in a linked list based on the ‘name’ they have stored in them.

To find their place in the list, i need to figure out if the name im inserting is earlier or later in the alphabet then those in the structures beside it.

The names are inside the structures, which i have access to.
I don’t need a full comaparison if that is more work, even just the first letter is fine.

Thanks for the help!

Answer 1

It’s not clear to me what your question is, but something like this would work:

if (node1->name[0] <= node2->name[0]) {
  ...
} else {
  ...
}

This will compare the first letter of the name in each of the nodes.