Selection Sort

Finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.
1) The subarray which is already sorted.
2) Remaining subarray which is unsorted.

Best,Worst and Average Case Time Complexity: O(n²).

Auxiliary Space: O(1)


Knowledge is everything.Check out my app at

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Nginx — The Web Server for the Future

What is AAS (As a Service)?

What is Searching ? What are the common searching algorithms ?

Hey Docker run EKS, with Auto Fleet Spotting Support, please!

Try Hack Me — Find Command — Write Up

Software Design: defining complexity when discussing technical approaches

Polymorphism: Class Inheritance, Mixins/Interface Inheritance, & Duck Typing.

Game Using Classes

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Pandiyan Mani

Pandiyan Mani

Knowledge is everything.Check out my app at

More from Medium

Day52 | 100DaysOfGADS

Google’s Super Aggregation for Pay-TV Operators and Streaming Services

Rx-Java Single and mergeDelayError Use

Writing Custom Rules for Android Lint