Skip to main content

Sorting Methods

Image
Sorting which is one of topic in data sructure is an important thing in real life for facilitate the data management. Data sorting can be implemented by ascending order or descending order. There are some methods for data sorting such as:
  • Insertion Sort
  • Selection Sort
  • Bubble Sort
  • Quick Sort
1. Insertion Sort
Straight insertion is a sorting method which takes a parenthesis data on ordered data and shoves data which is bigger than parenthesis data so parenthesis data can be placed on right place. For example, there is an array that contains these number :
3 12 2 4 13 5
If the data above is sorted in ascending by straight insertion, the result is:
Parenthesis Data Sorting Result
12
3 12 2 4 13 5
In 1st loop, 2nd data of array becomes parenthesis data, then being compared with all previous data (3). If there is no data which is bigger than parenthesis data, there is no data that will be shove backward.
2
3 12 2 4 13 5
In 2nd loop, 3rd data of array becomes parenthesis data, then being compared with all previous data (3, 12). There are two data which are bigger than parenthesis data so those data will be shoved one step backward and put parenthesis data at 1st place.
4
2 3 12 4 13 5
In 3rd loop, 4th data of array becomes parenthesis data, then being compared with all previous data (2, 3, 12). This data will be placed at 3rd place.
13
2 3 4 12 13 5
In 4th loop, 5th data of array becomes parenthesis data, then being compared with all previus data (2, 3, 4, 12). Because there is no data that bigger than the parenthesis data so the parenthesis data still be in the 5th place.
5
2 3 4 12 13 5
In 5th loop, 6th data of array becomes parenthesis data, then being compared with all previous data (2, 3, 4, 12, 13). This data will be placed at 4th place.
Result
2 3 4 5 12 13

2. Selection Sort
This method is a sorting method that will look for smallest or biggest value depend on ascending or descending order then being placed at the forefront place. After that, it will look for the next smallest or biggest value along all elements of array reduced by 1, and so on. For example, there is an array that contains these number :
3 12 2 4 13 5
If the data above is sorted in ascending by selection method, the result is:
Minimum Value Sorting Result
2
3 12 2 4 13 5
In 1st loop, it will look for smallest value between 1st and 6th element of array. 2 is the smallest value so its place will be switch with 1st element.
3
2 12 3 4 13 5
In 2st loop, it will look for smallest value between 2nd and 6th element of array. 3 is the smallest value so its place will be switch with 2nd element.
4
2 3 12 4 13 5
In 3rd loop, it will look for smallest value between 3rd and 6th element of array. 4 is the smallest value so its place will be switch with 3rd element.
5
2 3 4 12 13 5
In 4th loop, it will look for smallest value between 4th and 6th element of array. 5 is the smallest value so its place will be switch with 4th element.
12
2 3 4 5 13 12
In 5th loop, it will look for smallest value between 5th and 6th element of array. 12 is the smallest value so its place will be switch with 5th element.
Result
2 3 4 5 12 13

3. Bubble Sort
This method will switch two element continously until sorting has been finished. This method is not efficient but easy to be realized.
3 12 2 4 13
If the data above is sorted in ascending by bubble sort method, the result is:
Note Sorting Result
1st loop, compare 1st and 2nd element. Because 1st is smallest than 2nd so there is no exchange
2 12 3 4 13
2nd loop, compare 2nd and 3rd element. Because 3rd is smallest than 2nd so there is exchange between 2nd and 3rd
2 12 3 4 13
3rd loop, compare 3rd and 4th element. Because 4th is smallest than 3rd so there is exchange between 3rd and 4th
2 3 12 4 13
4th loop, compare 1st and 2nd element. Because 1st is smallest than 2nd so there is no exchange
2 3 4 12 13
And so on until 16th loop. Why it is until 16th loop. It has been sorted at 4th loop. Because there are 5 element so there must be 4 exchange process for each term and also must be done 4 times to ensure that all elements has been sorted.
Result
2 3 4 12 13

4. QuickSort
This method will make a data table that will be sorted into two parts which are traced from left and from right. For example, there is an array that contains these number :
3 12 2 4 13 5
If the data above is sorted in ascending by selection method, the result is:

Step Notes
1
  • Array will be traced from left and from right.
  • Array[1] is the first element from the left, then it will trace from the right to the left to find smaller value than Array[1].
  • Array[3] which is smaller than Array[1] will be switched.
  • Array[2] is next element from the left. Array[6] which is smaller will be switched.
2
  • We have sub-array. There is no switching because Array[1] is smaller than Array[2].
  • Array[3] is first element from the left of new array, then it will trace from the right. There is no smaller value than Array[3] so there is no switching.
3
  • When we move Array[3] to left sub-array, we know that there is no smaller value than it at right sub-array.
  • At left sub-array, Array[1] as the first element will be compared with another element from the right to the left. But, we don't get any value, so Array[1] must be the smallest value.
  • Array[2] and Array[3] are switched.
  • First element of right sub-array is Array[4]. After tracing from right to left, there is no smaller value than Array[4], so it will be move to left sub-array then.
  • Second element of right sub-array is Array[5]. It will be compared with last element from the right. Because it is bigger, Array[5] is switched by Array[6] 
4
  • We have gotten Array[1] and Array[2] sorted.
  • Array[3] and Array[4] will be switched after being traced.
  • Next, there is no smaller value than Array[5] at right sub-array so there is no switching.
5
  • From the third step, we know that there is no smaller value than Array[4] in right sub-array, so after it is switched with Array[3] at fourth step, it must be sorted.
  • Array[6] is smallest value and there is no smaller value, so it also must be sorted.


Referensi : Belajar Pemrograman dengan Bahasa C++ dan Java - Shalahuddin dan Rosa
Labels:

Comments

Post a Comment

Popular posts from this blog

Increase of Malicious Activities and Implementation of reCaptcha

In recent time, I've seen the increase of malicious activities such as login attempts or phishing emails to some accounts I manage. Let me list some of them and the actions taken. SSH Access Attempts This happened on a server that host a Gitlab server. Because of this case, I started to limit the incoming traffic to the server using internal and cloud firewall provided by the cloud provider. I limit the exposed ports, connected network interfaces, and allowed protocols. Phishing Attempts This typically happened through email and messaging platform such as Whatsapp and Facebook Page messaging. The malicious actors tried to share a suspicious link lured as invoice, support ticket, or something else. Malicious links shared Spammy Bot The actors leverage one of public endpoint on my website to send emails. Actually, the emails won't be forwarded anywhere except to my own email so this just full my inbox. This bot is quite active, but I'm still not sure what...
Post a Comment
Read more

Configuring Swap Memory on Ubuntu Using Ansible

If we maintain a Linux machine with a low memory capacity while we are required to run an application with high memory consumption, enabling swap memory is an option. Ansible can be utilized as a helper tool to automate the creation of swap memory. A swap file can be allocated in the available storage of the machine. The swap file then can be assigned as a swap memory. Firstly, we should prepare the inventory file. The following snippet is an example, you must provide your own configuration. [server] 192.168.1.2 [server:vars] ansible_user=root ansible_ssh_private_key_file=~/.ssh/id_rsa Secondly, we need to prepare the task file that contains not only the tasks but also some variables and connection information. For instance, we set /swapfile  as the name of our swap file. We also set the swap memory size to 2GB and the swappiness level to 60. - hosts: server become: true vars: swap_vars: size: 2G swappiness: 60 For simplicity, we only check the...
3 comments
Read more

Deliver SaaS According Twelve-Factor App

If you haven't heard of  the twelve-factor app , it gives us a recommendation or a methodology for developing SaaS or web apps structured into twelve items. The recommendation has some connections with microservice architecture and cloud-native environments which become more popular today. We can learn the details on its website . In this post, we will do a quick review of the twelve points. One Codebase Multiple Deployment We should maintain only one codebase for our application even though the application may be deployed into multiple environments like development, staging, and production. Having multiple codebases will lead to any kinds of complicated issues. Explicitly State Dependencies All the dependencies for running our application should be stated in the project itself. Many programming languages have a kind of file that maintains a list of the dependencies like package.json in Node.js. We should also be aware of the dependencies related to the pla...
2 comments
Read more

Kenshin VS The Assassin

It is an assassin versus assassin.
Post a Comment
Read more

Free Cloud Services from UpCloud

Although I typically deploy my development environment or experimental services on UpCloud , I do not always stay updated on its announcements. Recently, I discovered that UpCloud has introduced a new plan called the Essentials plan, which enables certain cloud services to be deployed at no cost. The complimentary services are generally associated with network components or serve as the foundation for other cloud services. This feature is particularly useful when retaining foundational services, such as a load balancer, is necessary, while tearing down all services and reconfiguring the DNS and other application settings each time we temporarily clean up infrastructure to reduce costs is undesirable.  When reviewing the service specifications of the cloud services in the Essentials plan, they appear to be very similar to those in the Development plan. The difference in service levels is unclear, but it could be related to hardware or resource allocation. For instance, the loa...
Post a Comment
Read more

What's Good About Strapi, a Headless CMS

Recently, I've been revisiting Strapi as a solution for building backend systems. I still think this headless CMS can be quite useful in certain cases, especially for faster prototyping or creating common websites like company profiles or e-commerce platforms. It might even have the potential to handle more complex systems. With the release of version 5, I'm curious to know what updates it brings. Strapi has launched a new documentation page, and it already feels like an improvement in navigation and content structure compared to the previous version. That said, there's still room for improvement, particularly when it comes to use cases and best practices for working with Strapi. In my opinion, Strapi stands out with some compelling features that could catch developers' attention. I believe three key aspects of Strapi offer notable advantages. First, the content-type builder feature lets us design the data structure of an entity or database model, including field ...
Post a Comment
Read more