SORTING A LIST!!

• 

  Using selection sort :The inner loop selects the minimum element in the unsorted array and places the elements in increasing order.

• 

  Using Insertion Sort : Take element from given array, place it in itscorresponding position in sorted part & shift the elements accordingly.

• 

  Using Bubble Sort : if arr[i]>arr[i+1] swap them. To place element in their respective position, we've to do following operation N-1 times.

Inspiration : Sorting a list fascinated me as it makes easier for us whenever we have to to find a particiular data from a list containing more no of details if it's arranged in a particular order and saves our precious time!!

What it does : It'll help us arrange a large amount of data in ascending or descending order for numerical values or Alphabetically

How we built it : We'll be writing the code to sort the given data in different programming languages and different formats

Challenges we ran into : It's a well known concept while learning a particular language, so no such challenges faced

Accomplishments that we're proud of : Our codes run well in first go...yeah!

What we learned : We can make our tasks easier by implementing such codes!

What's next for Sorting A list : Writing the code in different formats and executing our code on IDEs

Built With

• c++