Mash allah. those videos are awesome and very helpful it is not a complement it real. I really like the way you teach and it so understandable and I am student in USA and your videos helps me a lot, so please I would like from you make a series of videos in c++ because I was struggling to understand the concept in English. I am sorry for bothering you. finally Jazak allah khair.
Right, the expected number of operations is often less than the worst case number of operations. A famous example is quick sort. That's why average case analysis makes sense.
I really can't thank you enough for these videos. just one little question. in your implementation for the sieve algorithm you considered 1 not to be a prime number. in the problem 406 in the uva website, prime cuts, 1 is a prime number. so it is a prime number or not? :)
great videos thanks a lot, one more suggestion, and I hope I'm not being annoying :) a link for further information like a wikipedia link or recommended reading, sure students can find that on their own, but I'm also sure you may have something us student won't think of. and is the code you are using uploaded somewhere ? your efforts are really appreciated, do you need any help ? is there any thing we can do ? thanks again :)
Because the first loops don't iterate on all numbers....so we need something to iterate over all of them. e.g. if n = 10000, is prime condition is activated 100 times only
in 17:41 if you counted the pairs of before you and after you, you'll face overlapping in the last row when you count the first x left and right cells so we have 2 then the second x its left is the previous x right, how will you manage to remove the duplicates. I think every streak of Xs we have to remove its length -1 from the counting to avoid duplicates, am I right ??
what if i want to find the primes between 2 numbers and according to this algorithm , the running time takes more than 15 seconds if the input is 1000000 and if the input is 1000000000 it will not work the vector size will be 1 billion is there any other way to get around that and thanks for this professional lesson
هو انا لي في اللوب بجيب باقي القسمه عل الارقام ال primes بس ؟ مش المفروض اجرب علي كل الارقام الاصغر منه يعني في ال loop بدات من 3 وكل مره ب ازود 2 لي مش 1 ! اعذرني علي الاستفسار ده
1 is not a prime number for sure prime numbers have 2 divisors itself and 1 But number 1 only divisible by 1 number so it's not :D search in wiki and u will understand
Reverse thinking is awesome.
Great tutorial as usual !!!.
بارك الله فيك يا دكتور بجد شرح غاية فالروعة وبيفدني جدا, والشيت نفسه خيييال, جزاك الله خيرا
جزاك الله خيرا , بجد حاجة حلو أننا نلاقي العرب بدقوا يدخلوا في الموضيع ديه و بدقوا يساعدوا بعض بالشروحات
شرح رائع جدا وماتع
جزاك الله خيرا يا دكتور ، نحبك في الله .
هو انا موعود اسمع فيديوهاتك بعد اما احل المسائل لوحدي ويطلع عيني بس فيديو روعه بجد🥰🥰
It is already on my channel. It is part of a playlist too.
Mash allah. those videos are awesome and very helpful it is not a complement it real. I really like the way you teach and it so understandable and I am student in USA and your videos helps me a lot, so please I would like from you make a series of videos in c++ because I was struggling to understand the concept in English.
I am sorry for bothering you.
finally Jazak allah khair.
جزاك الله خيرا على الشرح الرائع دا
I created 4 play lists with each category. Thanks for comment
جزاكم الله خيرا
أحسن الله إليكم
اسمه ايه
دكتور مصطفي سعد ابرهيم@@hrurfbkyfgjkyrwqwipplmbczaqyok
الفكرة جميلة جدا بس محتاجين مقدمة في البداية خالص تبقى lecture 0
تشرح بس ليه محتاجين الالجوريذمس اصلا وايه فايدتها وتدي نبذة تاريخية عن الموضوع وكده
Right, the expected number of operations is often less than the worst case number of operations. A famous example is quick sort. That's why average case analysis makes sense.
6:43
مش الكومبايلر بيعمل أوبتميزيشن للكلام ده؟
sorry I will search for them thanks for your efforts :)
Really good
Pls go on and stop doing more lessons
شكرا .. جزاك الله خيراَ
Select Max Quality + Full Screen.
I really can't thank you enough for these videos.
just one little question.
in your implementation for the sieve algorithm you considered 1 not to be a prime number.
in the problem 406 in the uva website, prime cuts, 1 is a prime number.
so it is a prime number or not? :)
nope 1 not prime but sometimes he consider 1 is prime but in fact 1 not prime
Do you understand arabic
at 1:32
how this equation work , n/logn ?
for example x=10
3= 10/log10
* log base 2
and for x= 1000
the result will be 813 , big difference !
what is wrong about a big difference ?
en.wikipedia.org/wiki/Prime_number_theorem
In "Concrete mathematics Book" prime number theorem is x/ln(x), and i think its more closer estimate
ربنا يجازيك خير
Thanks for the great effort, just one little question,
are these videos arranged in a playlist ?
SA,
Check the comments on a video..links and problems to solve are there :)
I think you need to make a channel for this good videos
great videos thanks a lot, one more suggestion, and I hope I'm not being annoying :)
a link for further information like a wikipedia link or recommended reading, sure students can find that on their own, but I'm also sure you may have something us student won't think of.
and is the code you are using uploaded somewhere ?
your efforts are really appreciated, do you need any help ?
is there any thing we can do ?
thanks again :)
Question?
Do you have website?
Thanks
JWA...for c++ concepts...this is so far from current scope, which is algorithms.
وعليكم السلام ورحمة الله وبركاته
السلام عليكم
اعتقد أنه يجب مراجعة شي
fun3 isprime3 better than isprime4 becuse i try them and alwase fun3 be better
could u plz tell me wy ??
رائع جدا
minute 12:10: why do i have to count the prime numbers in a separate loop? why not count it inside isPrime[i]?
Because the first loops don't iterate on all numbers....so we need something to iterate over all of them.
e.g. if n = 10000, is prime condition is activated 100 times only
Thanks, dr!
Great
in 17:41 if you counted the pairs of before you and after you, you'll face overlapping in the last row when you count the first x left and right cells so we have 2 then the second x its left is the previous x right, how will you manage to remove the duplicates. I think every streak of Xs we have to remove its length -1 from the counting to avoid duplicates, am I right ??
what if i want to find the primes between 2 numbers and according to this algorithm ,
the running time takes more than 15 seconds if the input is 1000000 and if the input is 1000000000 it will not work the vector size will be 1 billion is there any other way to get around that and thanks for this professional lesson
يعني يا دكتور لما اكون مثلا عاوز احسب ال prime number لغاية 9 ادور لغاية ال3 بس !
ايون بالظبط ....
How did you test which one is better?
هو انا لي في اللوب بجيب باقي القسمه عل الارقام ال primes بس ؟ مش المفروض اجرب علي كل الارقام الاصغر منه
يعني في ال loop بدات من 3 وكل مره ب ازود 2 لي مش 1 !
اعذرني علي الاستفسار ده
الاول هنختبر الرقم يبقبل القسمة على 2
لو لا
بنختبر فقط الاعداد الفردية
1 is not a prime number for sure
prime numbers have 2 divisors itself and 1
But number 1 only divisible by 1 number so it's not :D
search in wiki and u will understand
Hello Sir,
why when i use the sieve algorithm and the input is 1000000 to count all the prime numbers in this range,it takes 20 seconds to count....?
+Mahmoud AbdelGhani something wrong! Not logical. 1 million is reasonable range..i expect maximum 2 seconds.
anyway,,,try release mode NOT debug mode.
جزاكم الله خيرا