Professional Documents
Culture Documents
Isas 1 Kel 5
Isas 1 Kel 5
(ISAS)
Written by :
Dinah Aryani Zavitri (2220010111)
M. Albaihaqi Azis (2220010131)
Faculty:
Listyo Edi Prabowo, S.T., M.T.
Class:
3ISA2
CEP CCIT
FAKULTAS TEKNIK UNIVERSITAS INDONESIA
Preface
First of all, the author would like to give a great thanks to the almighty God because of His
grace and guidance, our paper is entitled Architecture Technology of Inductive Charging
(Wireless Charging), and thanks to our lecturer, Mr. Listyo Edi Prabowo, S.T., M.T., for this
assignment and for allowing us to know how to make ISAS. We hope this task makes us
better in the future to do some tasks in the future, because of our limited knowledge, We
believe there are still shortcomings in this paper and also we believe that our paper is far from
perfect but we try our best to make it not far from perfect. Therefore, we expect suggestions
and positive criticism from readers for the perfection of this paper.
Author
TABLE OF CONTENT
PREFACE2
TABLE OF CONTENTS3
CHAPTER I5
INTRODUCTION5
CHAPTER II7
BASIC THEORY7
2.1 Algorithm7
2.2 Data Structure8
2.3Sorting Algorithm9
2.4 Types of Sorting Algorithm11
CHAPTER III12
PROBLEM ANALYSIS12
3.1 Radix Sort12
3.2 How Radix Sort Work12
3.3 Example of Sort Work13
CHAPTER IV13
CONCLUSION AND SUGGESTION14
4.1 Conclusion15
4.2 Suggestion15
BIBLIOGRAPHY16
TABLE OF FIGURES
Figure 3.1.1 LSD ………………………………………………………………….....5
Figure 3.1.2 MSD …………………………………….………………………..…….6
Figure 3.2 How Radix Sort Work ………………………………………………..….6
Figure 3.3 Example of Sort Work...………………………………………………….7
CHAPTER I
INTRODUCTION
1.1 Background
A programming algorithm is a series of processes that must be followed in a calculation to
solve other problems, especially in computer programs. Almost all programming-related
activities do not arise from algorithms. Algorithms themselves are instructions that allow a
computer to perform a set task. Allow tasks to complete without error.
One part of the algorithm itself is sorting. A Sorting Algorithm is used to rearrange a given
array or list of elements according to a comparison operator on the elements. The comparison
operator is used of decide the new order of elements in the respective data structure. One of
the most common sorting algorithms is Radix sort
Radix Sort is an algorithm or sorting method (sorting) without comparison in other words,
sorting Non-Comparation sort which in the process does not make comparisons between data.
The word radix means literally the position in the number.
process, and the writing framework are all discussed in this chapter.
which are based on the ideas regarding this paper the authors made.
CHAPTER II
BASIC THEORY
2.1 Algorithm
An algorithm is a set of commands that must be followed for a computer to perform
calculations or other problem-solving operations. According to its formal definition, an
algorithm is a finite set of instructions carried out in a specific order to perform a particular
task.
Data structure is a way to store and organize data in computer memory and files effectively,
so that all data can be used efficiently.
Following are some important categories of algorithms from the data structure point of view:
2.Data Structure
The purpose of the sorting algorithm is to facilitate the process of manipulating or analyzing
the data in the structure, by organizing the data in an orderly and easy-to-understand
sequence so that it can help facilitate the process of searching or analyzing the data. The
sorting process is done by comparing one data value with another data value, and swapping
or inserting data in the right position, so as to produce the desired order.
Each of these algorithms has its own strengths and weaknesses, and the choice of algorithm
depends on factors such as the size of the input, the distribution of values, and the desired
performance characteristics.
CHAPTER III
PROBLEM ANALYSIS
3.1 Radix Sort
Radix Sort is an algorithm or sorting method (sorting) without comparison in other words,
sorting Non-Comparison sort which in the process does not make comparisons between data.
The word radix means the literal position in the number. Where simply, in decimal
representation, the radix is the digit. In its implementation, Radix Sort is a fast, easy, and very
effective sorting algorithm.
1. LSD (Least Significant Digit), where processing starts from the least significant radix.
Sorting is done by sorting the input values based on the last digit to the first digit.
2. MSD (Most Significant Digit), where processing starts from the most significant
radix. Sorting is done by sorting the input values based on the first digit, then proceed
again based on the second radix and so on.
The process of radix sort works similar to the sorting of students names, according to the
alphabetical order. In this case, there are 26 radix formed due to the 26 alphabets. In the first
pass, the names of students are grouped according to the ascending order of the first letter of
their names. After that, in the second pass, their names are grouped according to the
ascending order of the second letter of their name. And the process continues until find the
sorted list.
Radix sort works by sorting each digit from least significant digit to most significant digit. So
in base 10 (the decimal system), radix sort would sort by the digits in the 1's place, then the
10’s place, and so on. To do this, radix sort uses counting sort as a subroutine to sort the
digits in each place value. This means that for a three-digit number in base 10, counting sort
will be called to sort the 1's place, then it will be called to sort the 10's place, and finally, it
will be called to sort the 100's place, resulting in a completely sorted list. Here is a quick
refresher on the counting sort algorithm.
Do the following for each digit I where I varies from the least significant digit to the most
significant digit. Here will be sorting the input array using counting sort (or any stable sort)
according to the i’th digit.
Figure 3.3 Example of Sort Work
In a typical computer, which is a sequential random-access machine, where the records are
keyed by multiple fields radix sort is used. For eg., if want to sort on three keys month, day
and year. Author could compare two records on year, then on a tie on month and finally on
the date. Alternatively, sorting the data three times using Radix sort first on the date, then on
month, and finally on year could be used.
It was used in card sorting machines with 80 columns, and in each column, the machine could
punch a hole only in 12 places. The sorter was then programmed to sort the cards, depending
upon which place the card had been punched. This was then used by the operator to collect
the cards which had the 1st row punched, followed by the 2nd row, and so on.
CHAPTER IV
CONCLUSION AND SUGGESTION
4.1 Conclusion
The conclusion from the given information is that Radix Sort is a non-comparison sorting
algorithm that works by sorting each digit from the least significant digit to the most
significant digit. Radix Sort uses counting sort as a subroutine to sort the digits in each place
value. It is a fast, easy, and effective sorting algorithm. Radix Sort is commonly used in
computer systems where records are keyed by multiple fields. It is also used in card sorting
machines with 80 columns where the machine could punch a hole only in 12 places, and the
sorter was then programmed to sort the cards, depending upon which place the card had been
punched.
4.2 Suggestion
The suggestion from Radix Sort is really recommended for sorting because Radix Sort is a
fast, easy, and very effective sorting algorithm. The concept of the algorithm is easy to
understand. Algorithm radix sort sorts data by digits, not go through a lean comparison
process difficult to understand. At first, the radix type can only be used for data type bit and
decimal. But, over time, radix sort began to be developed for other data types. Moment this
radix sort can already be used for data types as fractions and negative numbers.
BIBLIOGRAPHY
Arief, Rahman. (2010, April 29). Analisis Algoritma Radix Sort. Retrieved March 17, 2023,
from https://informatika.stei.itb.ac.id/~rinaldi.munir/Matdis/2012-2013/Makalah2012/
Makalah-IF2091-2012-083.pdf
Karleigh, Moore. (2020, December 20). Radix Sort. Briliant.org. Retrieved March 17, 2023,
from https://brilliant.org/wiki/radix-sort/#:~:text=Radix%20sort%20works%20by
%20sorting,digits%20in%20each%20place%20value
Senapaty, Murali Krishna. (2015, December 12). Implementing Radix Sort With Linked
Buckets Using Lsd & Msd And Their Comparitive Analysis And Discussion On Applications
Retrieved March 16, 2023, from https://d1wqtxts1xzle7.cloudfront.net/87781989/51_20ijecs-
libre.pdf?1655730440=&response-content-disposition=inline%3B+filename
%3DImplementing_Radix_Sort_With_Linked_Buck.pdf&Expires=1679042665&Signature