2 ms·
I don't see how the algorithm is relevant here.
by Kiro 12y ago
I don't see how the algorithm is relevant here.
- mackwic 12y agoIt quite easy in fact: before going asynchronous, people should learn datastructures and algorithms adapted to what they want to do. It's wiser to limit the work your CPU has to do rather than hide this work behind high-level non-deterministic structures like WebWorkers like no work is done. Don't get me wrong, I'm not saying that WebWorker are useless. I just say that really costly operations are rare if you know your DS and complexities. Oh, by the way, you usually don't have to implement theses datastructures yourself. Even javascripts have [collections](http://www.collectionsjs.com/ http://www.collectionsjs.com/).
- TheLoneWolfling 12y agoBecause with a half-decent sorting algorithm you wouldn't need to use multithreading for this? On my machine with that particular 50k length array it takes 7ms if I just do "a.sort();".
- mackwic 12y agoHey ! Bubble sort can be a descent algorithm when you know when and how to use it ! After all, it is the fastest sorting algorithm when your collection is already sorted ! Moreover, it has very nice properties which make it suitable for a lot of concurrent operations.
- TheLoneWolfling 12y agoInsertion sort is faster for already-sorted data. (Note: I am not advocating to use insertion sort!)