Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 515197
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T07:36:12+00:00 2026-05-13T07:36:12+00:00

How do you compare and sort chararrays in a linked list, cant you compare

  • 0

How do you compare and sort chararrays in a linked list, cant you compare like this ‘Smith’ > ‘Andersson’ ?

struct person {
char name[20];
struct person *nextPerson;
};

.
void createNode(PersonPtr *sPtr, struct person t[]){
  PersonPtr newPtr; /* pointer to new node */
  PersonPtr previousPtr; /* pointer to previus node in  list */
  PersonPtr currentPtr; /* pointer to current node in list */
.
/* loop to find correct location in the list */
while (currentPtr != NULL && t->name > currentPtr->name) { /* this will not sort on name */
  previousPtr = currentPtr; /* walk to... */
  currentPtr = currentPtr->nextPerson; /* ...next node */
}/* end while */
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T07:36:12+00:00Added an answer on May 13, 2026 at 7:36 am

    Close, but not quite, you can’t just use “>” or “<” on strings. What you want is strcmp.

    What you want is:

    while (currentPtr != NULL && strcmp(t->name,currentPtr->name) > 0)
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

How do i pass a pointer to a member function to std::list.sort()? Is this
I am looking for a method to compare and sort UTF-8 strings in C++
Does a comparison sort have to compare the A[i] largest and A[i+1] largest values?
I've got an application that's using string.compare(string,string) to sort some values. The thing I
I would like to compare a screenshot of one application (could be a Web
I would like to compare the contents of a couple of collections in my
sort provides two kinds of numeric sort. This is from the man page: -g,
I am writing a string compare function to sort medical terms that often contain
Compare String.Format(Hello {0}, World); with Hello {0}.Format(World); Why did the .Net designers choose a
I just wanted to compare different solutions used when implementing ACLs in Rails.

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.