# Time Complexity Of Algorithm in Hindi

Time Complexity Of Algorithm in Hindi – Data Structure in Hindi – Hum Iss Post Mein Learn Karenge ke Time Complexity Kya Hai Or Iska Basically Matlab Kya Hota Hai Aur Ye kin-kin Factors Pe Depend Karti Hai.

Yadi Aapne  HTML Full Course  And CSS Full Course And Python Full Course And PHP Full Course Nhi Read Kiya Hai To Aap Vah Bhi Read Kar Sakte Hai |

## Time Complexity Of Algorithm in Hindi

Kisi Algorithm Ki Time Complexity Ye Batati Hai Ke Vo Algorithm Kitne Time Mein Apne Operations Pura Karti hai (Jabki Har Ek Operation Execute Hone Mein Sabko Equal Time Lagta Hai) Jo Algorithm Jitna Kam Time Legi Vo Utni Hi Badiya aur Tez (Fast) Algorithm Maan Li Jayegi. Waise Time Complexity Thodi Bahut Operating System Pe Bhi Depend Karti Hai lekin Uski Baat Hum Yha Nahi Karenge.

Isko Ek Example Se Samajhte Hai. Lets Take Two Algorithms Jo ki Hai Linear Search Aur Binary Search Algorithm.

Linear Search– Iss Algorithm Mein Hame Jo element Search Karna Hoga Hum uske Sabke Sath Check Karte Jayenge Uski Vajah Se Hame Jyada Time Lagega Isliye Iss algorithm Ki Time Complexity Bhi Jyada Ho Jayegi, Jo Ki Hum Bilkul Bhi Nahi Chahte Hai. Isko Ek Example Se Samajhte Hai.

Also ReadIntroduction Of Data Structure In Hindi

Jaise Ki Aap iss Figure Mein Dekh Sakte Hai Agar Hamein Element 33 search Karna hai Toh Hamein Isko Har Ek Element Ke Sath Check Karna Padega, Agar 33 Ki Position 7th Hai toh hamein Ye Operation 7 baar Karna Padega Toh Time Complexity Bhi Jyada Aayegi Agar Hum Ye Task Kam operations mein Kar Payein Toh Hmari Time Complexity Kam Ho jayegi Aur Hmari Algorithm Bahut Fast Run Ho Payegi toh Aage Dekhte Hai Binary Search

Binary Search- Isme Ham Time Complexity Ko reduce Kar Denge, jyada samajhne ke Liye Niche Wali Figure Dekho. Iss Algorithm Ko Apply Karne Ke Liye Hamara Data Sorted Hona Chahiye Matlab Chote Se Bade Mein Hona Chahiye

Maan Lo Hamko element Number 15 Find Karna Hai toh Iss Question Ko Hum linear Search Se 8 operation Mein Poora Kar paate Ab dekhte hai Binary Search se Ye Kitne Mein Ho jaega.

Pehle hum pointer set karenge start par aur ek pointer End par, fir Hum Ek Variable Bnaege Mid Jisme Hum Rakhenge Inn Dono ka Mid.

ab Hame search karna hai 15 toh Ye steps FOLLOW KARO

• Mid pe check karo – Hamare mid par hai 8 jo ki 15 se kam hai, toh 15 pakka Right mein hoga toh Start pointer ko le Jao 8 par
• ab Dubara mid Check Karo, jo ki hai 12 ye fir 15 se kam hai Toh, 15 Pakka Right Side Mein Hoga toh iss baar 12 ko start Bna lo
• Dubara Mid PAR Check Karo,iss bar jo hmara mid aya hai vo 15 ke equal aaya hai toh Hamara Task Complete Hota Hai
• iss algorithm se hamne 3 operation Mein Isko Complete Kar Liya Hai toh Time Complexity Kam Ho Jaegi.

Also Read – Asymptotic Notations In Hindi

Friends Mujhe Umeed Hai Ki Aapko Time Complexity in Hindi Ke Bare Mai 100% Jankari Ho Gayi Hogi | Agar Aapko Learn Karne Main Dikkat Aa Rahi Hai To Aap Mere Se Contact Kar Sakte Hai |