Algorithm Simulation Application

Hi Friends...... :)
Today I'm going to share my 2nd year 1st semester project with you, an algorithm simulation Application. As we all know simulator is a substitution of something, which will do the same functionalities with less performance or with less features but won't omit the important functionalities. This algorithm simulator will handle 2 algorithms, Selection sort and Bubble sort. So let's start the game. 

Algorithm Simulator is an application created for the users who are new to algorithm and sorting. When it comes to algorithm there are so many algorithms such as insertion, selection, bubble, heap, quick sort etc. In this application, selection sort and bubble sort have been demonstrated with the aid of animation, dry run and pseudo code. The user will get a basic yet clear idea of selection sort and bubble sort.

1. Selection Sort
Selection sorting is conceptually the simplest sorting algorithm. This algorithm first finds the smallest element in the array and exchanges it with the element in the first position, then finds the second smallest element and exchange it with the element in the second position, and continues in this way until the entire array is sorted.
Complexity of Selection sort
Worst case time complexity: O (n^2)
Best case time complexity: O (n^2)

 2. Bubble Sort
Bubble Sort is an algorithm which is used to sort N elements that are given in a memory for example an array with N number of elements. Bubble Sort compares the entire element one by one and sort them based on their values. It is called Bubble sort, because with each iteration the smaller element in the list bubbles up towards the first place, just like a water bubble rises up to the water surface. Sorting takes place by stepping through all the data items one-by-one in pairs and comparing adjacent data items and swapping each pair that is out of order.
Complexity of Bubble sort
Worst case time complexity: O (n^2)
Best case time complexity: O (n)

 The application is built using visual studio 2013 in C#. Lets take a look at the application process.
Step 01 : Run the app.
Fig 1 : Run the app
 Step 02 :  Click on Generate Numbers button to get random numbers for sorting.         
Fig 2 : Generate numbers
Step 03 :  Select the algorithm type in which you want to sort the randomly generated numbers. Also provide the sorting order, ascending or descending. Click on Sort array. You'll get the final output as sorted array.
Fig 3 : Selection of algorithm and sorting order
 Step 04 : Click on simulate button to see the simulation of the algorithm. 
Fig 4 : Simulation of the algorithm
 Step 05 : Pop-up window will prompt saying that the sorting is completed. 
Fig 5 : Sorting completed
Step 06 : Click on Dry run button to see the algorithm pseudo code and the dry run. 
Fig 6 : Pseudo code of the sorting algorithm

Comments

Post a Comment

Popular posts from this blog

Hashing... First Step to Secure Software Programming

Image
Where it all started? Anyone in the field of programming wouldn't have missed the chance of implementing a login page. This login page might look very simple and straightforward. But in reality, it is not. What most of us would have done for our first login page is a simple string comparison for both username and password which might have already been hard-coded in the program. Some might have retrieved the username and password from the database and compared it with the user entering credentials based on roles. If we think about this scenario in a real-world enterprise or corporate level applications, the authentication procedure will not take place as simple as that. Authentication Authentication is all about ensuring that the system is being accessed by the correct user. Authentication plays a very important role in most of the systems or applications. The reason is to prevent the system from unauthorized access. Authentication methodologies 1. Username Password authentic...
Read more

Encryption to take secure programming a step forward

Image
[http://blog.trendmicro.com/wp-content/uploads/2012/03/Cartoon-2.jpg] What is "Encryption"? Why is it associated with secure programming? What are the benefits of encryption? These are questions to be evaluated in this blog post along with some interesting facts about encryption. As we all know hashing is a one-way process in which the plain text/input cannot be retrieved from the hash value. What if we want to get the plain-text from the hash value? What could be the solution? The solution is Encryption . Encryption Encryption is a technique used to convert a plain text into an encoded format or cipher-text which could be reversed back to the original plain text. Unlike hashing, encryption is a two-way technique. Fig 1: The flow of encryption Fig 2: Encryption/Decryption related details for the Fig 1 Since encryption is a two-way process it allows the users to retrieve the encrypted value back to its original text. This is very useful in terms...
Read more

RMI - Weather station

Image
Hi friends !!!! :) Today I like to share one of my projects with you..... It's basically a weather station  where weather readings are gathered and updated using RMI technology, Java Remote Method Invocation. The Java Remote Method Invocation (RMI) system allows an object running in one Java virtual machine to invoke methods on an object running in another Java virtual machine. RMI provides for remote communication between programs written in the Java programming language. Fig 1: RMI method invocation Since we have the theory background of RMI I thought of sharing my project in which I have implemented a very basic client-server program using RMI to pass information from server to the monitoring station. As we all know in a weather forecasting station we have to gather the weather readings and send them in a periodic manner to all the stations connected to the server. Through this we can invoke methods running in one Java virtual machine through an object running in a...
Read more