It's commonly said to use QuickSort or Merge Sort for file sorting.
However, we can analyze the problem carefully to gain benifits.
As the author said, easy programme can be safer, robuster, more effective and more reliable.
So we need to find a good way to balance the time complexity and space complexity.
In prac01.java
, I implemented the sort algorithm in the book.
And when I type n = 100000, it turned out that library function in java needs 34s while using bitmap needs only 7s!
-
Notifications
You must be signed in to change notification settings - Fork 0
zzghost/programming-pearls-practice
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published