Big O(n) Notation 🤔📈

Big O(n) ka matlab hai “linear time”. Iska matlab hai ki jaise-jaise input size (n) badhta hai, waise-waise algorithm ka execution time bhi directly proportional tarike se badhta hai.

Agar input size double hota hai, toh execution time bhi double hoga. Agar input size 10x hota hai, toh time bhi 10x badhega.

Easy Explanation with Example 🛒

Socho tum supermarket gaye ho aur tumhe apna favorite item search karna hai:

  • Agar supermarket ke shelves kam hai, tum jaldi search kar loge.
  • Agar shelves zyada hai, tumhe utna hi zyada time lagega sab dekhne me.
    Input size (shelves) ke saath search ka time directly badhta hai. Yeh hota hai O(n). 🕒

Example in Code 💻

function findItem(array, target) {
    for (let i = 0; i < array.length; i++) {
        if (array[i] === target) {
            return i; // Item mil gaya, index return karo
        }
    }
    return -1; // Item nahi mila
}

Yahaan algorithm ko worst-case mein poore array ke elements check karne padenge. Agar array size bada hoga, toh time bhi proportionally badhega. Iska Big O hai O(n). 📋

Daily Life Examples 🧺

  1. List Mein Naam Dhoondhna (Search Karna): Socho tumhare paas 100 logon ki list hai aur tumhe “Reyansh” ka naam dhoondhna hai. Tum ek-ek naam check karte jaoge. Jitne zyada log, utna zyada time lagega. O(n).

  2. Shopping Cart ka Total Calculate Karna: Tumhare cart mein 5 items hain toh tumhe 5 prices ko add karna padega. Agar 50 items hain, toh 50 prices ko add karna hoga. Items badhne par time bhi badhega. O(n).

  3. Parks Mein Apna Dost Dhoondhna: Tum ek park ke har kone mein jaake check karte ho ki dost kahan hai. Agar park chhota hai, jaldi ho jayega. Agar park bada hai, toh zyada time lagega. O(n). 🏞️

Key Points to Remember 📝

  • O(n) ka matlab: Time input size ke directly proportional hai.
  • Performance: Efficient hai, but O(1) se slow hai.
  • Real Life: Har wo task jo ek-ek element process kare, mostly O(n) hoga.

⏳ Jaise input badega, waise kaam ka time bhi badega.

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