std::sort Exception with Non-Strict Comparison Function
The following program, compiled with VC 2012, exhibits unexpected behavior:
#include <algorithm> struct A { int a; bool operator<(const A& other) const { return a <= other.a; // Potential issue } }; int main() { A coll[8]; std::sort(&coll[0], &coll[8]); // Crash may occur return 0; }
Problem Explanation
The issue arises because the comparison function operator< does not strictly follow the requirements of std::sort. According to the C Standard Library (Sect. 25.3.1.1), std::sort requires comparison functions that fulfill the so-called "strict weak ordering" property. However, the comparison function in the given program only allows elements to be considered equal but not strictly less than each other. This can cause ambiguity and potentially lead to infinite loops in the sorting algorithm.
Strict Weak Ordering Rule
The strict weak ordering rule states that for a comparison function '>' (also applicable to '<'):
- If a > b, then b !< a
- If a >= b and b >= a, then a == b
Implication for the Comparison Function
In the given code, the comparison function operator< violates the strict weak ordering rule because it allows for cases where elements can be equal (a == b) but not strictly less than each other (not a < b). This non-strict behavior violates the requirements of std::sort and can lead to undefined behavior, including a crash.
Solution
To fix the issue, the comparison function should be modified to strictly compare elements:
struct A { int a; bool operator<(const A& other) const { return a < other.a; // Strict comparison } };
With this modification, the program should run as expected without crashing.
The above is the detailed content of Why Does `std::sort` Crash with a Non-Strict Less-Than Operator?. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

Yes, function overloading is a polymorphic form in C, specifically compile-time polymorphism. 1. Function overload allows multiple functions with the same name but different parameter lists. 2. The compiler decides which function to call at compile time based on the provided parameters. 3. Unlike runtime polymorphism, function overloading has no extra overhead at runtime, and is simple to implement but less flexible.

C has two main polymorphic types: compile-time polymorphism and run-time polymorphism. 1. Compilation-time polymorphism is implemented through function overloading and templates, providing high efficiency but may lead to code bloating. 2. Runtime polymorphism is implemented through virtual functions and inheritance, providing flexibility but performance overhead.

Yes, polymorphisms in C are very useful. 1) It provides flexibility to allow easy addition of new types; 2) promotes code reuse and reduces duplication; 3) simplifies maintenance, making the code easier to expand and adapt to changes. Despite performance and memory management challenges, its advantages are particularly significant in complex systems.

C destructorscanleadtoseveralcommonerrors.Toavoidthem:1)Preventdoubledeletionbysettingpointerstonullptrorusingsmartpointers.2)Handleexceptionsindestructorsbycatchingandloggingthem.3)Usevirtualdestructorsinbaseclassesforproperpolymorphicdestruction.4

People who study Python transfer to C The most direct confusion is: Why can't you write like Python? Because C, although the syntax is more complex, provides underlying control capabilities and performance advantages. 1. In terms of syntax structure, C uses curly braces {} instead of indentation to organize code blocks, and variable types must be explicitly declared; 2. In terms of type system and memory management, C does not have an automatic garbage collection mechanism, and needs to manually manage memory and pay attention to releasing resources. RAII technology can assist resource management; 3. In functions and class definitions, C needs to explicitly access modifiers, constructors and destructors, and supports advanced functions such as operator overloading; 4. In terms of standard libraries, STL provides powerful containers and algorithms, but needs to adapt to generic programming ideas; 5

Polymorphisms in C are divided into runtime polymorphisms and compile-time polymorphisms. 1. Runtime polymorphism is implemented through virtual functions, allowing the correct method to be called dynamically at runtime. 2. Compilation-time polymorphism is implemented through function overloading and templates, providing higher performance and flexibility.

C polymorphismincludescompile-time,runtime,andtemplatepolymorphism.1)Compile-timepolymorphismusesfunctionandoperatoroverloadingforefficiency.2)Runtimepolymorphismemploysvirtualfunctionsforflexibility.3)Templatepolymorphismenablesgenericprogrammingfo

C destructorsarespecialmemberfunctionsthatautomaticallyreleaseresourceswhenanobjectgoesoutofscopeorisdeleted.1)Theyarecrucialformanagingmemory,filehandles,andnetworkconnections.2)Beginnersoftenneglectdefiningdestructorsfordynamicmemory,leadingtomemo
