test[go]: go性能测试

This commit is contained in:
godotg
2022-09-08 22:56:41 +08:00
parent 46a5de95cb
commit 920ce3b449
2 changed files with 124 additions and 0 deletions
+70
View File
@@ -0,0 +1,70 @@
package main
import (
"fmt"
"time"
)
func main() {
// 预热
test()
// 正式执行
test()
}
func test() {
var startTime = time.Now()
var arr = []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13}
const NUM int = 100000000
for i := 0; i < NUM; i++ {
bubbleSort(arr)
}
fmt.Println(time.Since(startTime).Milliseconds())
}
//排序
func bubbleSort(arr []int) {
for j := 0; j < len(arr)-1; j++ {
for k := 0; k < len(arr)-1-j; k++ {
if arr[k] < arr[k+1] {
temp := arr[k]
arr[k] = arr[k+1]
arr[k+1] = temp
}
}
}
}
/**
public class MainTest {
public static void main(String[] args) {
// java的jit预热
test();
// 正式执行
test();
}
static void test() {
// 正式执行
var startTime = System.currentTimeMillis();
var array = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13};
for (var i = 0; i < 100000000; i++) {
bubbleSort(array);
}
var endTime = System.currentTimeMillis();
System.out.println(endTime - startTime);
}
public static void bubbleSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] < arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
}
*/
+54
View File
@@ -0,0 +1,54 @@
package main
import (
"fmt"
"time"
)
func main() {
// 预热
test()
// 正式执行
test()
}
func test() {
var startTime = time.Now()
for i := 0; i < 10000; i++ {
fibonacci(32)
}
fmt.Println(time.Since(startTime).Milliseconds())
}
func fibonacci(i int) int {
if i < 2 {
return i
}
return fibonacci(i-2) + fibonacci(i-1)
}
/**
public class MainTest {
public static void main(String[] args) {
// java的jit预热
test();
// 正式执行
test();
}
static void test() {
// 正式执行
var startTime = System.currentTimeMillis();
for (int i = 0; i < 10000; i++) {
fibonacci(32);
}
var endTime = System.currentTimeMillis();
System.out.println(endTime - startTime);
}
static int fibonacci(int i) {
if (i < 2) return i;
return fibonacci(i - 2) + fibonacci(i - 1);
}
}
*/