class HelloWorld { public static void main(String[] args) { int i = 1; int s = 1; int n =100; // Insert 100 for test. Cant use n cz its giving error due to infinite case.
I think the value of s series that is put 2,4,7,10,.... is wrong because when i=2 s=3(s=1,i++,s=s+i).so here the n no. of sum formula will not work. Because there is no formula for this type of series 2,4,7,10,.,... as because it neither AP nor GP. The n number of sum formula for AP series is n(n+1)/2. As it works only for the value 4 so results come 10 and it is thought that this series is working on the formula. But if you take k=2 it will show 3 but in series the value showing s =4 for i=2. So there is a small problem in this lecture. Otherwise your video is well.
Thank you. Your videos on time complexity have cleared all my concepts. Keep on the good work and please make a complete series on Data Structures and Algorithms.
Dont watch this video. it has alot of mistakes. Strange how 60 people liked this video. There are so many mistakes. Problem 1# i and s values are not correct Problem 6# the answer is nlogn
@codearchery you are misleading students. Please post edits / corrections. Better yet, post an updated / corrected video and take this down. I like your approach and visual clarity but please double check your work.
![Time Complexity of Algorithms and Asymptotic Notations [Animated Big Oh, Theta and Omega Notation]#1](http://i.ytimg.com/vi/bxgTDN9c6rg/mqdefault.jpg)
For anyone wondering, the values of i and s should be,
i 1, 2, 3, 4, 5, 6 ect
s 1, 3, 6, 10, 15, 21 ect
i think you are wrong dear
he is right. test this java code in a compiler
class HelloWorld {
public static void main(String[] args) {
int i = 1;
int s = 1;
int n =100; // Insert 100 for test. Cant use n cz its giving error due to infinite case.
while(s
when i equal to 4 ,s is equal to 11 .is it wrong ?
Im Sorry to say this sir bcoz I really enjoy watching ur vedios but these series of DAA are so clear....
I think the value of s series that is put 2,4,7,10,.... is wrong because when i=2 s=3(s=1,i++,s=s+i).so here the n no. of sum formula will not work. Because there is no formula for this type of series 2,4,7,10,.,... as because it neither AP nor GP. The n number of sum formula for AP series is n(n+1)/2. As it works only for the value 4 so results come 10 and it is thought that this series is working on the formula. But if you take k=2 it will show 3 but in series the value showing s =4 for i=2. So there is a small problem in this lecture. Otherwise your video is well.
In problem 6, time complexity will be n*(logn), look again
There is something wrong with the formula of problem-1, It will not work for k=1,2,3... It's only working for k=4
In problem no 1 the formula k(k+1) doesn't work for value 2 and 3
Thank you.
Your videos on time complexity have cleared all my concepts.
Keep on the good work and please make a complete series on Data Structures and Algorithms.
well done
Dont watch this video. it has alot of mistakes.
Strange how 60 people liked this video.
There are so many mistakes.
Problem 1# i and s values are not correct
Problem 6# the answer is nlogn
Please upload a video that from where we can start competitive programming please
this is very handy
@codearchery you are misleading students. Please post edits / corrections. Better yet, post an updated / corrected video and take this down. I like your approach and visual clarity but please double check your work.
Thanks a lot sir ❤