SORTING AND SEARCHING FILE

-
Heyya ladss, back with me, the student of computer science in Binus University, so after we've been learning about file processing, we will move on to searching and sorting file. So, basically there are 5 types of sorting in a file, so what do we need sorting for bruh? analogically, do you prefer to search for your comic books in your bookselves just by searching it when it's mixed up with various comics and random volume numbers, or when it's sorted out comics by comics, and the volumes number are in sequence? Rethorical, isn't it? especially when you're dealing with a large amount of datas, that's why sorting is quite crucial, and the types of sorting are various too, starting with easy concept of sorting till complicated one, so if you have a small amount of data, you can use easy one, but if not, you'd rather use complicated ones, so classyfing by the complexity of sorting method, we can rank it from the easiest which is : bubble sort, selection sort, insertion sort, and the ones that are considered intermediate are quick sort and merge sort. Depending to the number of datas and the sequences, bubble sort may takes a few days, or even weeks, that can be sorted by merge sort and will only take only a few minutes. Meanwhile for searching, it's also rethorical of how important it is, just imagine that you have a large amount of database in excel for shipping data, you can obviously imagines how hard is it to search for the particular shipping data that you want one by one from the top line until you find it, not only that, the data you have may also have the same data in most column, the item name that is being shipped may be the same, or the client's name, or even the destination,etc. ,and it's a pain to look at every lines and column one by one.There are 3 main types which are linear search,binary search, and interpolation search. The basic differences are : linear uses a search key, which means the data can be found literally anywhere, you can find it in the beginning or even in the very end. It's not much different from searching manually one by one, but the point is that it searchs based on a certain key, that differentiates one data from another, instead of looking at it one by one. Meanwhile, for binary search, it's usually used when you have much more data than you can handle by linear such, the main point is splitting your data by 2 sides, and goes on to the side where your data exists, and repeat you process of splitting data until your data is found. Lastly, interpolation search which is close to binary search, but it is executed with approximate location of where the data exists, just like how things work in dictionaries and bibles, when you want to search for Matius, of course you search at the new testament, not old testament, and if you want to search algorithm in your dictionary, of course you search at the letter T part,not A, B, or any other alphabets, but this only applies in dictionaries in the form of a book, not only ones. This is the sample code for bubble search and selection sort.

#include<stdio.h>

FILE *fp;
int number[100];
int n,minimum;

void bubble_sort()
{
int temp;
for(int i=0;i<n;i++)
{
for(int j=n-1;j>=i;j--)
{
if(angka[j-1]>angka[j])
{
temp=angka[j-1];
angka[j-1]=angka[j];
angka[j]=temp;
}
}
}
}

void selection_sort()
{
int temp;
for(int i=0;i<n;i++)
{
minimum=i;
for(int j=i+1;j<n;j++)
{
if(angka[min]>angka[j]) // if you want to search for maximum, just change it into <
{
minimum=j;
}
}
temp=angka[minimum];
angka[minimum]=angka[i];
angka[i]=temp;
}
}

void view_data()
{
for(int i=0;i<n;i++)
printf("%d ", angka[i]);
}

void read_file()
{
n=0;
fp=fopen("thisissorting.txt", "r");
while(!feof(fp))
{
fscanf(fp, "%d\n" , &angka[n]);
n++;
}
fclose(fp);
}

int main()
{
read_file();
view_data();
printf("\n");
bubble_sort();
view_data();
read_file();
view_data();
printf("\n");
selection_sort();
view_data();

return 0;
}

Luis Indracahya
2201758934
luis.indracahya@binus.ac.id
skyconnectiva.com

Komentar

Posting Komentar

Postingan populer dari blog ini

FUNCTIONS(DATA AND VOID),RECURSION

-
Gambar
The libraries that we use in C, consists of functions, for example in <stdio.h>, there exits functions, such as printf, scanf, fprintf, fscanf, etc. And each and every functions, are also made by coding, but in order to make it easier for us, the libraries are provided by the C language itself. If not, each time we want to print something, we have to code complicated stuffs , instead of just typing printf, to call the function that will execute the printing process. BUT did you know? Besides using the function that is provided by the C library, you can also make your own function, in order to simplify things, so if you want to use a process many times, you don’t have to copy paste it all over and over   again every time it needs to be used, but instead you can just declare it as a function, so every time you need to use it, you just need to type the function in one line. And each function needs to be declared, basically there are data and void functions, so what is the dif...
Baca selengkapnya

Algorithm And Programming-Repetition

-
ALGORITHM AND PROGRAMMING PROGRAM CONTROL-REPETITION (C Programming Language) What is Repetition? Basically,a repetition is one or more programs that are  repeated for a number of times which number can be defined first or defined later according to the condition.  So,there are 3 ways to do looping in C programming,which is for,while,dowhile,and for is the one that is predefined,meanwhile while's and dowhile's number is defined later Forever in C can be used like this: while ( true ) {      printf ( "hello, world \n " ); } Or... we can also use do while What is the difference?While vs do while? well for do while,we must "do" it first before checking the condition,so the loop will be executed at least once,meanwhile for while,we must check the condition before executing it even once. The while   keyword means that the loop will run as long as the Boolean expression inside the parentheses is true. And si...
Baca selengkapnya

Algorithm and programming-review

-
So good morning lads,today i won't be posting as detailed as possible,we're having mid-term examination next week here at Binus,so we're having a review session in the auditorium of our campus.So whatt we're studying here at Binus is firstly introduction to C in our first week,so the programming language that we use as a start here at Binus is C,which is the mother of all language in programming,but we're usually using Dev C++,which is a compiler for C++,but it also works for C.Usually we're having a laboratorium class after this, but not for the first week.And for the next week we're studying about operands,operators,and arithmetic with a professor from Taiwan.The week after, we're back to auditorium class with Mr. Fidelson and Mr. Henry,every week since then, we apply what we learn in our tutorial class, with different lecturer in each class, and as for me,i got lectured by Mr. Fidelson from our auditorium class. The following what we learn is in sequ...
Baca selengkapnya