|
|
|
|
|
|
by marginalia_nu
1120 days ago
|
|
|
You still see quite a lot of primitive number sorting in library code. If you want your Java code to go fast, you typically stick to primitives in arrays. Most Java application code doesn't, but it typically uses libraries that do. A sorted array is a priority queue, a binary search tree, etc. |
|
|