Relative Content

Tag Archive for naming

C project avoiding naming conflicts

I’m struggling to find pragmatic real-world advice on function naming conventions for a medium sized C library project. My library project is separated into a few modules and submodules with their own headers, and loosely follows an OO style (all functions take a certain struct as first argument, no globals etc). It’s laid our something like:

C project avoiding naming conflicts

I’m struggling to find pragmatic real-world advice on function naming conventions for a medium sized C library project. My library project is separated into a few modules and submodules with their own headers, and loosely follows an OO style (all functions take a certain struct as first argument, no globals etc). It’s laid our something like:

C project avoiding naming conflicts

I’m struggling to find pragmatic real-world advice on function naming conventions for a medium sized C library project. My library project is separated into a few modules and submodules with their own headers, and loosely follows an OO style (all functions take a certain struct as first argument, no globals etc). It’s laid our something like:

Why is Quicksort called “Quicksort”?

The point of this question is not to debate the merits of this over any other sorting algorithm – certainly there are many other questions that do this. This question is about the name. Why is Quicksort called “Quicksort”? Sure, it’s “quick”, most of the time, but not always. The possibility of degenerating to O(N^2) is well known. There are various modifications to Quicksort that mitigate this problem, but the ones which bring the worst case down to a guaranteed O(n log n) aren’t generally called Quicksort anymore. (e.g. Introsort).