C VS C-Sharp

C: https://github.com/TheAlgorithms/C/blob/master/sorting/merge_sort.c

prime.c

I like the awesome-algorithms link, but some of the code linked is definitely not perfect. A few questionable things from one of the header files [0] in https://github.com/TheAlgorithms/C:

- Defines a macro with no parentheses

- Uses unsigned for length and capacity (should be size_t)

- Uses () instead of (void) for an empty parameter list

- Useless use of "extern" for function declarations

- I think that leading double underscores and structures ending with _t are reserved identifiers, but I don't really have a good source for this

[0]: https://github.com/TheAlgorithms/C/blob/master/data_structur...

What I initially viewed as a challenging and sometimes even daunting process transformed into a school of resilience and excellence. The lessons I absorbed from TheAlgorithms were not just theoretical but practical. They found their way into my professional work, where I began to apply the same level of meticulousness and precision. The experience reminded me that in the world of coding, attention to detail and adherence to strict standards can make all the difference between code that merely functions and code that excels.

The previous post on this blog makes another worthless comparison, this time based on lines of code:

https://withinboredom.info/blog/2022/03/16/my-favorite-langu...

> Like, look at this Merge Sort in C# [1] (130 lines) and then look at it in PHP (31 lines) [2]. You can’t beat that kind of productivity, not to mention in PHP, you can even mix data types (like ints and floats) where in the C# version, it’d be much more difficult.

[1] https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorit...

[2] https://www.w3resource.com/php-exercises/searching-and-sorti...

The C# version is the first Google result for "c# merge sort". But a later result is from w3resource.com, which where the PHP code came from. That C# code is only 55 lines and could easily be shorter by replacing loops with standard library calls:

https://www.w3resource.com/csharp-exercises/searching-and-so...

Also, both versions of the code from w3resources.com are trash -- they use an O(N) step to remove an element from the front of the array (array_slice in PHP and List.Remove in C#), which makes them O(N^2 log N), which is even worse than a naive selection sort or bubble sort.

Well, except the better C# comparison would be this one (same place, but sorts an array, not an ISequentialStorage, which the PHP version doesn't even attempt): https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorithms/Sorters/Comparison/MergeSorter.cs

There's a much more sensible C# merge sort implementation in the same repo as the oddly-over-the-top one linked in the article, which is very very close to the PHP one: https://github.com/TheAlgorithms/C-Sharp/blob/master/Algorit...