The first (and probably the most important) thing that any computer
programmer learns are the various algorithms for SORTING
data. They are absolutely critical for a complete understanding of the
whole computer science field itself. But it can get quite confusing at
times. Especially, when one wants to understand how each one of them
works? Or, How each one of them is different from the other?
We think we have an answer to that. Suppose you wish to introduce
somebody to the game of FOOTBALL. A verbal discription would not be very
helpful. The best solution would be to show a visual of the football game to
Same is the case with Sorting Methods. Through this project, we give a
visual discription of the various Sorting Algorithms, with the aim of
making learning easy and fun.
But the solution also gives rise to a more complex problem. How do we
represent the sorting algorithms visually. The solution is to create
unique visualization schemes to represent the status of
data elements at various instances of time.
This method of representation gives rise to a more complex field in
mathematics known as Dynamical Systems.
After the main idea of the project was concieved, the elements of the
project were distributed to the various team members.
Prof. Ashay Dharwadker