Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://github.com/j3-fortran/fortran_proposals/issues/101 below:

Sorting · Issue #101 · j3-fortran/fortran_proposals · GitHub

I wonder if sorting should be built into the language? This is such a fundamental thing that currently take a staggering amount of code to make it work with all intrinsic types and user-defined types (see for example here). I think C++ has sorting built in to its standard library.

Features:

• sort ascending or descending
• it works for all intrinsic numeric types (integer(kind=*) and real(kind=*))
• how about also a "sort x, while carrying y along"? That's always nice to have. See, for example, isort from SLATEC. Or even a variadic "sort x while carrying any number of other arrays along". And any of them can be any combination of types.
• maybe also indexing?
• how about lexical sorting? Including "[natural sorting]?(https://en.wikipedia.org/wiki/Natural_sort_order)".

I think it goes without saying that any well-designed future generic/templating feature should also allow one to apply a sorting algorithm (either one from a third-party library or maybe even the hypothetical intrinsic one) to a user-defined type with a minimum of code.

certik, epagone, gronki, hennink, waynelapierre and 2 more

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4