sorting whenever data is collectedthere comes time when it becomes necessary to sort the data the sorting operation is common to all datasetsbe it collection of namestelephone numbersor items on simple to-do list in this we'll study few sorting techniquesincluding the followingbubble sort insertion sort selection sort quick sort heap sort in our treatment of these sorting algorithmswe will take into consideration their asymptotic behavior some of the algorithms are relatively easy to develop but may perform poorly other algorithms that are little complex to write will show impressive performance after sortingit becomes much easier to conduct search operations on collection of items we'll start with the simplest of all sorting algorithms--the bubble sort algorithm sorting algorithms in this we will go through number of sorting algorithms that have varying levels of difficulty of implementation sorting algorithms are categorized by their memory usagecomplexityrecursionwhether they are comparison-based among other considerations