شرحك سفاحححح كثير وكميه معرفه محوطه ع قناه جد الاشي بجننن جد يعطيك العافيه والقناتك تسحق مليون المشترك ع قد المعرفه الي فيها ما بعرف كيف ما بعرف قناه هاي من قبل بس جد اشي مرتب والمعرفه فيها وطريقه طرح المعرفه عندك الاشي بجنن
Hello Mr, Thanks for your efforts. You said that the books said that the big O of inserting and deleting in/from linked lists is O(1) because it's for the first element only! big O as you know and as you mentioned in the pervious videos is the worst case, but for choosing the first element only and calculate it, that's not a measure! because in this case we can say that the big O of insertion and deletion for an array is O(1) such as the inserting and deleting from the end! That's not right!
I can consider that you implement a Stack in the next video not LinkedList (Don't forgetting that the Stack is a specific case from a linked list) but we want to precise what things are exactly not generally. So, in your case the implementation in the next video is for a Stack because there is no more than insertion and deletion of the first element, LIFO (Last In First Out). In this case the complexity was calculated for (insertion/deletion) or (push, pop) from a Stack. When you said the big O of push and pop from a Stack is O(1), I agree... Thank you.
شرحك سفاحححح كثير وكميه معرفه محوطه ع قناه جد الاشي بجننن جد يعطيك العافيه والقناتك تسحق مليون المشترك ع قد المعرفه الي فيها ما بعرف كيف ما بعرف قناه هاي من قبل بس جد اشي مرتب والمعرفه فيها وطريقه طرح المعرفه عندك الاشي بجنن
الله يجزاك الف خير يا دكتور 😂😍
صراحه شرح ممتاز ومبسط
بارك الله فيك اخي
مشكور أستاذي علي الدورة الأكثر من رائعة.
بس يا ريت تكمل لنا دورة الios ترا مستنيك
I will do soon
بارك الله فيك على الشرح الاكاديمي
Your voice is amaizing, it helps in learning💙
الله يجزيك الخير
Amazing 🤩
ممتاز شكرا لك
Big Thanks!!
شكرا لك
Hello Mr,
Thanks for your efforts.
You said that the books said that the big O of inserting and deleting in/from linked lists is O(1) because it's for the first element only! big O as you know and as you mentioned in the pervious videos is the worst case, but for choosing the first element only and calculate it, that's not a measure! because in this case we can say that the big O of insertion and deletion for an array is O(1) such as the inserting and deleting from the end! That's not right!
See next video you will understand Why?
I can consider that you implement a Stack in the next video not LinkedList (Don't forgetting that the Stack is a specific case from a linked list) but we want to precise what things are exactly not generally.
So, in your case the implementation in the next video is for a Stack because there is no more than insertion and deletion of the first element, LIFO (Last In First Out).
In this case the complexity was calculated for (insertion/deletion) or (push, pop) from a Stack.
When you said the big O of push and pop from a Stack is O(1), I agree...
Thank you.
السلام عليكم .. اخي لم أفهم ماذا تقصد عندما قلت (1) o للعنصر الواحد ثم فلت اما با space تحتاج ب (o (n ماذا تقصد ب space
المسافة بين العنصر للعنصر اللي بدي اضيفه او احذفه ، هيك فهمتها
حسين النعيمي اي مدرسه كنت ؟ داومت بالصناعه الخوارزمي ب شارع فلسطين؟
chokrannn bzaff for this tuto, I would like to know when I can need for example this link list in web application
بض.
انا مش فاهم next ده من نوع class يعني ده vairable ولا object
هو pointer
No its a properties for any node initialized from Node Class
كيف نقوم بحدف عقد من امام والوسط والخلف؟
انصحك بهذه القائمه الشرح فيها مفصل عن كل وظيفه تحتاجها في البلاي لست وفي لغات متعدده من بايثون إلى c++ و جافا
شكرا على النصيحة بتابع القائمة.
ايمتى أفضل الفيكتور على اللينك ليست
كيفيه اضافه node غير الاولى
مرحبا استاذنا عندك تلكرام
سلام عليك
ياريت شرح ل إدخال نص الي linked list و طباعته
بصراحة شرح معقد ومصطلحات غير مفهومة
هالمصطلحات تكوني ماخذتنهم ف الاساسيات للداتا ستركشر 😅
شكرا لك