Thanks for this series. Wishing you all the best for your career as a teacher where you can use the premium chalk creating the next generation of innovators.
I'm confused. At 5:04 you said that arr.length -1 would not include the last index in the array. So how come you typed "arr.slice(0, arr.length -1)" for the example? Thanks in advance.
Consider this: Log base 2 of 27 = log base 3 of 27 / log base 3 of 2 = C * log base 3 of 27 where C is a constant equal to 1 / log base 3 of 2. So because log base 2 of 27 and log base 3 of 27 only differ by the constant C, and because in Big O we ignore constants, they are both valid. So the base doesn’t matter but in my opinion, base 2 is more intuitive and more widely used in computer science
Just to let you know, I love the way you start your videos.
Thanks for this series. Wishing you all the best for your career as a teacher where you can use the premium chalk creating the next generation of innovators.
Premium chalk is a must
Man if we had you as our teacher at Rotterdam University, i would pay double for that.. damn man.
Hope you did well on your exams! 🙂
great way of explanation man...love it...keep it up
Thank you !
I'm confused. At 5:04 you said that arr.length -1 would not include the last index in the array. So how come you typed "arr.slice(0, arr.length -1)" for the example? Thanks in advance.
I was talking about arr.slice(). arr.length - 1 is the last index of the array.
what if n was devided by 3 instead of 2 would it still be O (log n) or would the base of log change to 3 ?
Consider this: Log base 2 of 27 = log base 3 of 27 / log base 3 of 2 = C * log base 3 of 27 where C is a constant equal to 1 / log base 3 of 2. So because log base 2 of 27 and log base 3 of 27 only differ by the constant C, and because in Big O we ignore constants, they are both valid. So the base doesn’t matter but in my opinion, base 2 is more intuitive and more widely used in computer science
you are so creative man desreve a sub
Thank you! Happy you enjoyed 🙂