Big O(log n) Notation 🧐📉

Big O(log n) ka matlab hai ki input size jitna badhta hai, kaam ka time utna dheere dheere badhta hai. Matlab agar tumhare paas bohot zyada data ho, tab bhi tumhara algorithm kaam jaldi karega. 💨

Simple Example 📚

Socho tumhare paas ek sorted list hai, jisme tumhe kisi specific item ko dhoondhna hai. Tum ek magic trick use karte ho:

  1. Pehle pura list ko do parts mein divide karte ho.
  2. Phir tum check karte ho ki tumhara item kis part mein ho sakta hai (left ya right).
  3. Fir se jo half ka part mila, usko do parts mein divide karte ho. Yeh step baar-baar repeat karte ho.
  4. Is tarah se tum jaldi se apne item tak pohanch jaoge.

Example: Guess the Number Game 🎮

Socho tumhe ek number guess karna hai, jo 1 se 1000 ke beech ho. Tumhare paas ek hint system hai jo tumhe batata hai:

  • "Higher" ya “Lower”.

Agar tum 1000 numbers mein se kisi ko guess kar rahe ho, toh tum pehli baar 500 number ke aas-paas guess karoge. Agar number 500 se kam hai, toh ab tum sirf 500 se kam numbers mein search karoge, aur agar zyada hai, toh tum 500 se zyada numbers mein search karoge.

Tum har baar half half karke numbers ko reduce karte jaoge. Agar number 1000 hai, toh 10 steps mein guess kar paoge. 😲

Example in Code 💻

function binarySearch(array, target) {
    let start = 0;
    let end = array.length - 1;

    while (start <= end) {
        let mid = Math.floor((start + end) / 2);  // Mid point
        if (array[mid] === target) {
            return mid;  // Found the target
        } else if (array[mid] < target) {
            start = mid + 1;  // Search the right part
        } else {
            end = mid - 1;  // Search the left part
        }
    }
    return -1;  // Not found
}

Yahaan binary search use ho raha hai, jisme list ko half-half divide karke tum apna target dhoondh rahe ho. Agar list mein 16 elements hain, toh tumhe maximum 4 steps lagenge, chahe 1000 elements hon.

Real-Life Example 🏡

  1. Phonebook Search 📖
    Agar tumhe kisi ka naam phonebook mein dhoondhna hai, aur phonebook sorted hai, toh tum middle page se start karte ho. Agar tumhara naam wahan nahi hai, toh tum decide karte ho ki tumhara naam left side mein ho sakta hai ya right side mein. Har baar tum half cheezein dekhte ho, isliye tum jaldi se find kar paate ho.

  2. Library Mein Book Dhoondhna 📚
    Socho tumhare paas ek sorted library hai. Tum directly middle book se start karte ho aur agar tumhari book left side mein hai, toh tum left side ki books dekhna start karoge. Agar right side mein hai, toh right side ki books. Ye process bhi log n (logarithmic) time mein hota hai.

Key Points to Samjho:

  • Big O(log n) ka matlab hai tumhare data ka size bada ho, toh bhi kaam ka time slowly badhega.
  • Kab hota hai? Jab tum half-half karke data ko search kar rahe ho, jaise Binary Search.
  • Efficient hai? Haan! Yeh bohot fast hota hai, especially jab tumhare paas bohot zyada data ho.

Moral of the story: Half karna zyada efficient hai! Tumhara time bohot dheere dheere badhega. 🚀

Comments

Post a Comment

Popular posts from this blog

Array ko Big O Notation🚀

Array kya karta hai Big O ke context mein? Arrays ka kaam seedha-saadha hai, ek jagah pe saare data ko store karna aur use access, add ya delete karna. Har kaam ke liye arrays ka time complexity alag hota hai, jo Big O notation ke through samjha jaata hai. 🧠📊 1. Access (Read) : Jab tum array se kisi specific element ko access karte ho, bas uski position (index) dekh kar value nikal lo. 💡 Example: Tum arr[2] likhte ho, aur directly third item mil jata hai. 👉 Time Complexity : O(1) (constant time) Mast fast hai! 🎯 2. Search : Agar tumhe array mein ek particular value dhoondhni hai (e.g., "Mujhe 42 kaha rakha hai?"), to tumhe har element check karna padta hai. 🔍 Example: Tumhare array me arr = [10, 20, 30, 40] hai. Agar 30 dhoondhna hai, to pehle 10, phir 20, aur phir 30 pe pahuchega. 👉 Time Complexity : O(n) Jitna bada array, utna zyada time lagega. 😅 3. Insertion : End me item add karna: Agar tum array ke end me ek value add kart...
Read more

JavaScript arrays

JavaScript arrays   ek mast aur versatile tool hai jo tumhare DSA (Data Structures and Algorithms) mein bahut kaam aate hain! 📚💻 Ab samjho  DSA ke context mein , arrays kaise kaam karte hain aur kya-kya operations perform ho sakte hain. 🚀 Array Basics in JavaScript JavaScript mein, arrays ekdum  flexible  hote hain: Tum  different types ke data  ek hi array mein rakh sakte ho. 🧃🍕💰 Example: let arr = [ 10 , "hello" , true , 42 ]; Tum  dynamic size  wale arrays bana sakte ho. Na koi size batana, na koi tension! 🌀 Common Operations in JavaScript Arrays (DSA Style) 1️⃣  Traversal (Array ke elements ko access karna) Traversal  ka matlab hai ek-ek karke har element ko dekhna. 👀 Example: let arr = [ 10 , 20 , 30 , 40 ]; for ( let i = 0 ; i < arr.length; i++) { console .log(arr[i]); // Output: 10, 20, 30, 40 } 👉  Big O Time Complexity :  O(n) Tumhe (n) elements check karne padenge. 2️⃣  Searching (Koi particular...
Read more

Big O Notation Graph

Image
  Yeh graph  Big O Notation  ka comparison dikhata hai, jo hume yeh samjhata hai ki algorithms ka  performance  kaise change hota hai jab input size nn badhta hai. 💻📈 1. O(1) - Constant Time (Light Blue Line) Mast wali line!  💙 Iska matlab hai:  Input size nn  kitna bhi ho, operations ka time same rahega. 😎 Example: Ek box se ek item nikalna, koi farak nahi padta kitne items hain. 🎁 👉  Super fast & efficient ! 2. O(log n) - Logarithmic Time (Cyan Curve) Slow growth wali line!  🔵 Jab input nn badhta hai, operations bahut dheere-dheere badhte hain. Example: Tum kisi dictionary mein ek word dhoondh rahe ho, aur beech-beech ke pages chhodte ja rahe ho. 📖 👉  Efficient hai, bade inputs ke liye bhi manageable. 3. O(n) - Linear Time (Purple Line) Seedhi simple line!  💜 Agar n double hota hai, toh kaam bhi double hoga. Example: Tum ek list ke sare items ek-ek karke dekh rahe ho. 🗒️ 👉  Decent, par bade inputs ke liye...
Read more