作者查詢 / fenir
作者 fenir 在 PTT [ Grad-ProbAsk ] 看板的留言(推文), 共26則
限定看板:Grad-ProbAsk
看板排序:
全部stationery261ChungLi54car38Jeans38bag37Japan_Travel37Mix_Match37iOS35shoes35MAC29HKMCantonese28LoL28watch27Grad-ProbAsk26Key_Mou_Pad22Suit_Style22graduate19MacDev19model19Steam19SuperBike19PC_Shopping16Simcity15StupidClown15IntlShopping12C_and_CPP11marvel10GraduateCram9Tech_Job9e-coupon8Gossiping8hypermall8biker7Tea7WOW6BASKET-RULES5book5Boy-Girl5Contacts5DigiCurrency5HandMade5LCD5MobileComm5ask4BoardGame4Browsers4CantonesePOP4CTSH97EXP4Interior4java4Liu4RDSS4Soft_Job4AndroidDev3Broad_Band3CareerPlan3CLHS-TALK3creditcard3CSonline3movie3CTSH963012Insurance2joke2kartrider2NCCU07_SW2Printer_scan2Programming2SENIORHIGH2share2WarCraft2Wine2Android1Anti-Fake1AntiVirus1ArtCenter1B97305XXX1Beauty1C_Chat1CAR-TUNING1CarShop1CATCH1Chemistry1Childhood1ck61st3121ck_17_3011ComGame-Plan1cookclub1Detective1Digitalhome1DragonBall1DSLR1EarthScience1FLAT_CLUB1Headphone1Hearthstone1IME1Japandrama1kawaii1KS97-3081KS97-3131KUAS1Leehom1Loan1LTK1MATLAB1MH1Moto_GP1Navigation1NCHUS1NCKU-Geront1NCU97ME-B1NCUFingrad031NDHU-LS991NDHU-phy991NKUTEE1North_Coast1NTHU_STAT941NTU-CLHS1NTUastclub1NtuDormM31NTUIBMB971NTUMiaoli1NTUT_Talk1Old-Games1PttNewhand1Railway1RealPlaying1rent-exp1RIPE_gender1SMSlife1SOFTSTAR1SpaceArt1Stock1Sub_Strategy1SuperJunior1Supermission1swim1TA_AN1TNFSH98th1TTU-talk1TuTsau1TY_Research1uni-talk1USC1XiangSheng1<< 收起看板(145)
3F→:請問課本哪的章節有講到這個定理@@?我householder這章沒找到01/27 21:47
6F→:謝謝!01/27 22:02
11F→:好的感謝!01/24 09:15
1F推:應該沒錯呀@@ y=x+3/2 你要不要確認一下答案01/20 18:45
4F→:感謝11/20 17:42
1F推:錯,你寫的只是一點,span{[1,1,1]}才對09/30 14:26
6F→:好像不一定要不全為0耶, 因為(0,0,0)也符合09/30 15:24
2F推:第一題看不太懂你寫的,lg* n是??09/30 14:43
7F推:這題是條件機率,就是在前提是剩下一種花色的牌的情況下09/13 23:05
8F→:剩下的花色為黑桃的機率是多少09/13 23:05
3F→:抱歉不太懂,那請問我在解答下那三句話錯是在哪?09/07 19:23
12F→:懂了感謝樓上諸位09/08 00:10
1F推:第一題的確是log1+log2+..+logn =ln1+ln2+ln3...ln n(e為底)09/06 21:09
2F→:然後用ln x的積分(0~n) =n*(ln n) - n09/06 21:10
3F→:畫那個長條柱狀圖(夾擊法),最後算出來是n*(ln n) = nlgn09/06 21:11
4F→:有錯請指正@@09/06 21:11
5F推:剛想了一下第二題09/06 21:21
6F→:第二層迴圈假設i=8, 所以j是從8>4>2>1>009/06 21:22
7F→:goo(m)在i=8這輪總共花了O(8)+O(4)+O(2)+O(1)的時間09/06 21:23
8F→:用等比公式算1*(2^lgi-1)/(2-1)= i-109/06 21:24
9F→:sigma(i=0~n-1)(i-1) = O(n^2)09/06 21:26
5F→:了解,感謝!09/05 15:03