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

  • SEARCH
  • Home
  • 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 930199
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T20:17:47+00:00 2026-05-15T20:17:47+00:00

Possible Duplicate: Which sorting algorithm is used by STL’s list::sort()? Which sorting algorithm can

  • 0

Possible Duplicate:
Which sorting algorithm is used by STL’s list::sort()?

Which sorting algorithm can be used for sorting std::list ?

  • 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-15T20:17:48+00:00Added an answer on May 15, 2026 at 8:17 pm

    It’s implementation defined. However, it must follow these restrictions (§23.2.​2.4):

    Stable: the relative order of the equivalent elements is preserved.
    Complexity: Approximately NlogN comparisons, where N == size().

    So it’s a stable sort with O(nlog n).

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Possible Duplicate: C++ STL: Which method of iteration over a STL container is better?
Possible Duplicate: Is there a website where I can see which HTML 5 tags
Possible Duplicate: Linked list interview question This is an interview question for which I
Possible Duplicate: ArrayList Vs LinkedList ArrayList vs. LinkedList which one is better for sorting
Possible Duplicate: Generating a list of which files changed between hg versions hg diff
Possible Duplicate: Which kind of pointer do I use when? I read that std::auto_ptr
Possible Duplicate: Which is faster/best? SELECT * or SELECT column1, colum2, column3, etc I
Possible Duplicate: Which is more correct: <h1><a>..</a></h1> OR <a><h1>..</h1></a> Semantically, which is more correct:
Possible Duplicate: Which collection for storing unique strings? I am currently using a Dictionary<string,
Possible Duplicate: Which is faster/best? SELECT * or SELECT column1, colum2, column3, etc. I

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.