-
Currently, the worst-case time complexity of parallel::sort seems to be O(N^2).
https://github.com/STEllAR-GROUP/hpx/blob/d55dc1b220b6ba78a715a38779180f995b632ae2/hpx/parallel/algorithms/sort.hpp#L…
-
There is a TODO in IntroSelector.java to use the median of medians algorithm instead of HeapSort for the worst case, as median of medians offers a better time complexity.
I've discussed this with @jp…
-
It would be really nice to have a benchmark comparing performance wrt std/re, std/nre; I haven't seen any.
This would also be useful for performance regression testing.
This could start small and be…
-
I am getting this error while running it.
CentOS Linux release 7.6.1810 (Core)
Linux srlinux 4.19.39-2.x86_64 #1 SMP PREEMPT Mon Mar 23 16:47:19 UTC 2020 x86_64 x86_64 x86_64 GNU/Linux
[root@m…
-
Looking at page `fr.wikipedia.org/wiki/Herbert_C._Brown`
In the Infobox is a section 'Autres informations'
The mediawiki version shows:
![sortorder1](https://user-images.githubusercontent.com/861…
-
Right now when removing elements from a sprite array you must pass in an array of uint16_t indexes in ascending order. If you were to pass them in a different order, then it would break.
Because of…
-
Write Heapsort algorithm.
* Either Use max-heapify or min-heapify to perform heapsort.
-
My project used libdivsufsort, it runs on macos, windows, linux, android, etc.
Now I want to use msufsort4, compile and test with xcode;
Single-threaded ok, running at about the same speed as …
-
hey @saru95 ... I am very much interested in helping you with Java Data Structures. So can u please add label "hacktoberfest" to this issue?
-
Rewrite more or already mentioned algorithms in Python 3 .