Selection Sort In Hindi – Sorting Algorithms In Hindi

Data Structure

Selection Sort In HindiSorting Algorithms In Hindi – Iss Post Mein Hum Dekhenge Selection Sort Ke Baare Mein Ki Ye Kis Kaam Mein Aati Hai, Isko Use Kaise Karte Hai Aur Ye Kis Tarah Se Useful Hoti Hai Sorting Karne Ke Liye.

Also Read – Introduction to Sorting And Bubble Sort

Selection Sort In Hindi

Selection Sort Ek Simple Sorting Algorithm Hai, Yr Algorithm Stating Se Start Hota Hai, Or End Tak Check Karta Hai, Ki Koi Starting Me Big Value To Nhi Hai, Agar Hoti Hai, To Use Swap Kar Deta Hai, Waise Selection Sort Pure Aarry Ko Unsort Manta Hai, Ise Ham Ek Example Se Understand Karte Hai |

Example:

Step 1:

Hamare Pass, Ek Unsorted Array Hai, Jo Aap Upper Image Me Dekh Sakte Hai, Jaise Ki Aap Dekh Sakte Hai, Left Side Me Sorted Array Hai Or Right Side Me Unsorted Array Show Kar Raha Hai, To Ab Ham Is First Number 64 Ko Check Karne Wale Hai, Pure Is Array Me.

64 Ko Check Karne Ke liye Ham Isse Low Number Find Karenge, To 64 Number Ek Ek Check Karke End Tak Jata Hai, Kyoki End Me 11 Number Sabse Low Number Hai, To Isliye 64 Or 11 Me Swap Ho Jayega |

Ab Dekh Sakte Hai, Ki Hamare Dono Number Swap Ho Gaye Hai,

Step 2:

Left Side Me Sorted Array Hai, Or Right Side Me Unsorted Array Hai, Ab Ham Right Side Ke 25 Number Ko Check Karne End Tak Or Dekhte Hai, Ki 25 Se Koi Number Low Hai Ya Nhi Hai To Ham Swap Kar Denge |

To Ab Dekh Sakte Hai, 25 Number Se Low Number 12 Hai, To Ham 25 Number Ko Or 12 Number Ko Ham Aapas Me Swap Kar Denge.

Aap Dekhte Sakte Hai, Hamne Dono Number Ko Swap Kar Diya Hai |

Step 3:

Ab Hamare Pass, Left Side Me Sorted Array Hai Or Right Side Me Unsorted Array Hai, Ab Ham 25 Number Ko Right Side End Tak Check Karenge Or Dekhenge Ki Koi Number 25 se Low Number To Nhi Hai.

Aap Dekh Sakte Hai, Ki 25 Number Se Right Side Me 22 Low Number Hai, To Ham Aapas Me 25 Or 22 Number Ko Swap Kar Denge.

Aap Dekhte Sakte Hai, Hamne Dono Number Ko Swap Kar Diya Hai |

Step 4:

Ab Hamare Pass, Left Side Me Sorted Array Hai Or Right Side Me Unsorted Array Hai, Ab Ham 25 Number Ko Right Side End Tak Check Karenge Or Dekhenge Ki Koi Number 25 se Low Number To Nhi Hai.

Jaise Ki Aap Dekh Sakte Hai, Ki 25 Number Se Right Side Me Koi Bhi Number Low Nhi Hai, To Ye Keval Isi Tarah Rahega Or Keval Sorted Array Ek Step Aage Chala Jayega |

Step 5:

Ab Hamare Pass, Left Side Me Sorted Array Hai Or Right Side Me Unsorted Array Hai, Ab Ham 64 Number Ko Right Side End Tak Check Karenge Or Dekhenge Ki Koi Number 64 se Low Number To Nhi Hai.

Jaise Ki Aap Dekh Sakte Hai, Ki 64 Number Ke Bad Koi Number Nhi Hai, To Ye Keval Aap Counter Step Aage Jake Ye Sorting Complete Ho Jayegi |

Aap Dekh Sakte Hai, Ki Selection Sort Ki Help Se Array Ko Sort Kar Liya Hai |

Finally, Iteration Ko Execute Karke Humko Sorted Data Mil Jaega, Ye Algorithm Bahut Simple Hai Execute Karne Mein Lekin Iski Time Complexity Best Case Me Order Of N Hoti Hai, And Worst Case Me Order of N Square Hoti.

Leave a Reply

Your email address will not be published.