tag:blogger.com,1999:blog-6294663875929591018.post5232671580901027437..comments2023-09-24T03:12:58.137-07:00Comments on Ramblings of a techie: TRIE data structure Part 5 : Complexity AnalysisBragBoyhttp://www.blogger.com/profile/01173019524783723568noreply@blogger.comBlogger10125tag:blogger.com,1999:blog-6294663875929591018.post-17197326841058052712012-12-19T11:52:11.633-08:002012-12-19T11:52:11.633-08:00Excellent job. You should write a book on all data...Excellent job. You should write a book on all data structures. Another thing is that you wrote the algo..after giving the code for insert and search. If algo could have been discussed first, it would have been a bit easier to understand for new bees like me. <br />Anyways, it was very good.<br />Thanks.Anonymoushttps://www.blogger.com/profile/05825817640453098896noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-82467564162373225322012-11-11T11:56:20.472-08:002012-11-11T11:56:20.472-08:00Can you give me any idea how can i compare 2 tries...Can you give me any idea how can i compare 2 tries?Anonymoushttps://www.blogger.com/profile/10712298036653578032noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-3538423079162194662012-06-02T15:19:45.535-07:002012-06-02T15:19:45.535-07:00Thanks Ramya for stopping by!Thanks Ramya for stopping by!BragBoyhttps://www.blogger.com/profile/01173019524783723568noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-85525473389511781502012-05-30T10:51:38.528-07:002012-05-30T10:51:38.528-07:00Very well explained!! great post.Very well explained!! great post.Ramya Priyadarshinihttps://www.blogger.com/profile/02056447949270196508noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-35237947013418414992012-05-23T16:50:30.772-07:002012-05-23T16:50:30.772-07:00Very good explanation. To the point and in Java :)...Very good explanation. To the point and in Java :)Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-41464822119613021122011-07-05T11:24:04.112-07:002011-07-05T11:24:04.112-07:00is ther c code for this..is ther c code for this..Balaji,https://www.blogger.com/profile/14956383352750925473noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-26551436114993547302011-04-10T05:11:13.693-07:002011-04-10T05:11:13.693-07:00@chiranjeevi: Happy to help!@chiranjeevi: Happy to help!BragBoyhttps://www.blogger.com/profile/01173019524783723568noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-60073869977802940022011-04-06T02:23:57.693-07:002011-04-06T02:23:57.693-07:00Thankyou very much for the clarification. Now, I g...Thankyou very much for the clarification. Now, I got it.Unknownhttps://www.blogger.com/profile/03423868815847926711noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-11957204276145538602011-03-28T22:02:40.233-07:002011-03-28T22:02:40.233-07:00@chiranjeevi:
To understand this, you will have to...@chiranjeevi:<br />To understand this, you will have to have a deep knowledge on what "Order" means. The Big O notation is used to tell how the complexity increases according to the increase in the input space. For TRIE ADT, the input space is the number of words that we use. Assume we have 10 words, the insert operation will take a total of its word length multiplied by the 26 letters in the linked list. Which will be equal to k*26. Applying Big O we have O(k*26) = O(1). The reason is this does not depend upon the increase in the number of words that the TRIE is going to have. <br />Even if the TRIE has a billion words, the insert operation will take a constant time of k*26 which is irrespective of 'n'. So, if you plot a curve you could see that its constant and in Big O terms, it is called as O(1) or constant time insertion.<br />Hope this helps.BragBoyhttps://www.blogger.com/profile/01173019524783723568noreply@blogger.comtag:blogger.com,1999:blog-6294663875929591018.post-45073056491241699322011-03-28T09:56:46.419-07:002011-03-28T09:56:46.419-07:00Hey, How come O(k) became O(1) in the above explan...Hey, How come O(k) became O(1) in the above explanation? Could you pls clarify me?Unknownhttps://www.blogger.com/profile/18343672104950277049noreply@blogger.com