Hi everyone, happy Morning.... When i was browsing abt the worst case complexity abt B+ tree , i saw it is O(logbN) , where 'b' here is the base. i need to know what number would base (b) will have (2 or 8 or 10 or 16 or e) , but when i was going in depth reading abt it.. they have mentioned about a term called 'Blocking Factor' which always be 100 in all cases. after that they have said that 'b' is 100. but hw base can be 100?? so i am not clear abt this statement. so please help me to know this with your idea's , thanks in advance:worried::worried::worried: With Regards, S.R.Vignesh