作者查詢 / galapous
作者 galapous 在 PTT [ Grad-ProbAsk ] 看板的留言(推文), 共248則
限定看板:Grad-ProbAsk
看板排序:
全部Grad-ProbAsk248Gossiping118graduate94joke69BoardGame67Boy-Girl57PathofExile50LoL40GuildWars39Steam39DIABLO38mobile-game31swim29WomenTalk28WarCraftChat23CFantasy21NTU20SMSlife17Soft_Job17ONLINE15tabletennis13KoreaDrama12Olympics_ISG10Tech_Job10Zhongzheng10DataScience9PokemonGO9sex9Tennis8NDSH_6th3147Hearthstone6OverWatch6PokeMon6DiabloEX5Minecraft5CareerPlan4ClashRoyale4Baseball3Beauty3NDSH3NTUcourse3NtuDormM83StupidClown3WarCraft3Chiayi2Examination2Finance2I-Lan2KS98-3022MobileComm2nb-shopping2NTUboardgame2Salary2Songs2study2WOW2AC_In1Battery1BattleRoyale1CATCH1Childhood1Daan1DNF1EatToDie1FITNESS1friends1HatePolitics1HomeTeach1Hsinchu1J-PopStation1japanavgirls1juniorhigh1Key_Mou_Pad1kodomo1marvel1MenTalk1MH1Miaoli1movie1NBA1NSwitch1NTTU_CSIE991NTU_BOTDorm1pal1PCReDive1PlayStation1PUBG1PublicIssue1RESIT1ShuangHe1StarCraft1Sub_GOnline1<< 收起看板(92)
3F推: heap加入刪除都是log n12/22 15:51
6F推: 加入元素會根據complete binary tree性質擺在下一個位置12/22 15:57
7F→: ,然後往上跟父點做比較,若小於父點(假設是min-heap)12/22 15:57
8F→: ,則與父親交換,重覆此動作直到父點比你小為止,此動作12/22 15:57
9F→: worst case就是一路換到root,即做了跟樹高同等次數,又12/22 15:57
10F→: heap是complete tree 故樹高=log n12/22 15:57
11F→: 考 打完才發現你懂了12/22 15:58
4F推: 第二題乘號後面接指數?12/22 11:17
5F→: 如果是63^2n的話就是O(63^2n)12/22 11:18
6F→: 63^2n和n^2同取log可比較成長率12/22 11:19
1F→: CLRS沒記錯的話有,很長12/21 19:21
9F推: 今天念到這章,entry在direct map跟fully時是指block數12/30 16:01
10F→: ,set時是指set數12/30 16:01
1F推: 00,01都是猜不跳10,11反之12/21 11:23
2F→: 起始state為00,吃到跳+1反之-112/21 11:23
3F→: 不懂自動機可看離散ch13or google12/21 11:25
5F推: 2n中所有數可以表示成2^a+b,其中a>=0 b為奇數12/20 20:42
6F→: 又2n中含n個奇數,by鴿籠,當取n+1個數時必有兩數b值相等12/20 20:42
7F→: 故ai|aj or aj|ai 沒寫很嚴謹 想法大概是這樣12/20 20:44
8F→: 上面柿子寫錯 是(2^a)*b12/20 20:45
9F→: 式12/20 20:45