Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix: javascript sort time #459

Merged
merged 1 commit into from
Nov 27, 2022
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions functional_benchmark_test.go
Original file line number Diff line number Diff line change
Expand Up @@ -43,16 +43,16 @@ func BenchmarkGoSliceHeapSort100000000(b *testing.B) {
benchmarkGoSliceSort(b, 100000000, "heapSort(testSlice);", jsHeapSort)
}

func BenchmarkJsArrayQuickSort10000(b *testing.B) {
benchmarkJsArraySort(b, 10000, "quickSort(testSlice, 0, testSlice.length-1);", jsQuickSort)
func BenchmarkJsArrayQuickSort500(b *testing.B) {
benchmarkJsArraySort(b, 500, "quickSort(testSlice, 0, testSlice.length-1);", jsQuickSort)
}

func BenchmarkJsArrayMergeSort10000(b *testing.B) {
benchmarkJsArraySort(b, 10000, "mergeSort(testSlice);", jsMergeSort)
func BenchmarkJsArrayMergeSort500(b *testing.B) {
benchmarkJsArraySort(b, 500, "mergeSort(testSlice);", jsMergeSort)
}

func BenchmarkJsArrayHeapSort10000(b *testing.B) {
benchmarkJsArraySort(b, 10000, "heapSort(testSlice);", jsHeapSort)
func BenchmarkJsArrayHeapSort500(b *testing.B) {
benchmarkJsArraySort(b, 500, "heapSort(testSlice);", jsHeapSort)
}

func BenchmarkCryptoAES(b *testing.B) {
Expand Down