Re: [作業] DSnP Hw2 對個答案
我比你的多一點
可是我在取random array的時候
有特地讓程式挑出全部不重複的數字
所以應該就會比你多
不過如果可以輸入重複的input
我想改成你那樣
N=5000
Simple Binary Tree: m=29.7725 n=28.3
AVL Tree m=22.6356 n=14
N=8000
Simple Binary Tree: m=31.0478 n=29.9
AVL Tree m=23.9938 n=14.45
N=11000
Simple Binary Tree: m=33.1203 n=30.5
AVL Tree m=24.9553 n=15
N=14000
Simple Binary Tree: m=32.9447 n=31.25
AVL Tree m=25.6635 n=15.85
N=17000
Simple Binary Tree: m=34.7636 n=32.15
AVL Tree m=26.2553 n=16
N=20000
Simple Binary Tree: m=35.0996 n=33.2
AVL Tree m=26.6945 n=16
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 219.84.16.3
推
05/08 21:14, , 1F
05/08 21:14, 1F
→
05/08 21:14, , 2F
05/08 21:14, 2F
推
05/08 23:53, , 3F
05/08 23:53, 3F
推
05/09 01:09, , 4F
05/09 01:09, 4F
推
05/11 01:51, , 5F
05/11 01:51, 5F
推
05/13 22:46, , 6F
05/13 22:46, 6F
討論串 (同標題文章)
完整討論串 (本文為第 2 之 2 篇):