Garuda - Garba Rujukan Digital

p-Index From 2021 - 2026

0.444

P-Index

This Author published in this journals

All Journal EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi Petir Jurnal Teknologi CCIT (Creative Communication and Innovative Technology) Journal ICIT (Innovative Creative and Information Technology) Journal CICES (Cyberpreneurship Innovative and Creative Exact and Social Science) Journal Cerita: Creative Education of Research in Information Technology and Artificial Informatics

Endang Sunandar

Universitas Raharja

Author-ID : 2407980

Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Engineering Law, Crime, Criminology & Criminal Justice

Published : 13 Documents Claim Missing Document

Claim Missing Document

Articles

Title

Perbandingan Metode Selection Sort dan Insertion Sort Dalam Pengurutan Data Menggunakan Bahasa Program Java Endang Sunandar
PETIR Vol 12 No 2 (2019): PETIR (Jurnal Pengkajian Dan Penerapan Teknik Informatika)
Publisher : Sekolah Tinggi Teknik - PLN

There are various kinds of sorting data methods that we know of which are Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Shell Sort, and Heap Sort methods. All of these methods have their respective strengths and weaknesses, the use of which is determined based on needs. Each method has a different algorithm, where the difference in this algorithm affects the execution time. In this paper the authors make a comparison of the 2 methods of sorting data, namely the Sort Sort and Insertion Sort methods, with consideration that the two methods are concise algorithms and have almost the same algorithm pattern. , using the same number and data model. The purpose of this comparison is to provide an overview of the two methods, which method has faster execution time, whether the Selection sort method or the Insertion Sort method.

Penyelesaian Sistem Persamaan Non-Linier Dengan Metode Bisection & Metode Regula Falsi Menggunakan Bahasa Program Java Endang Sunandar
PETIR Vol 12 No 2 (2019): PETIR (Jurnal Pengkajian Dan Penerapan Teknik Informatika)
Publisher : Sekolah Tinggi Teknik - PLN

The numerical method is a technique used to formulate mathematical problems so that they can be solved using ordinary arithmetic operations. In general, numerical methods are used to solve mathematical problems that cannot be solved by ordinary analytical methods. In the Numerical Method, we know two types of system equations, namely the Linear Equation System and the Non-Linear Equation System. Each system of equations has several methods. In the System, the Linear Equation between the methods is the Gauss Elimination method, the Gauss-Jordan Elimination method, the LU (Lower-Upper) Decomposition method. And for the Non-Linear Equation System between the methods is the Bisection method (Share-Two), Falsi Regula method, Newton Raphson method, Secant method, and Fix Iteration method. In this study, researchers are interested in comparing the two methods in the Non-Linear Equation System, namely the Bisection method and the Falsi Regula method. And this benchmarking process uses the Java programming language tool, this is to facilitate analysis of method completion algorithms, and monitoring in terms of execution time and output analysis. So that we can clearly know what differences occur between the two methods.

Perbandingan Metode Newton-Raphson & Metode Secant Untuk Mencari Akar Persamaan Dalam Sistem Persamaan Non-Linier Endang Sunandar; Indrianto Indrianto
PETIR Vol 13 No 1 (2020): PETIR (Jurnal Pengkajian Dan Penerapan Teknik Informatika)
Publisher : Sekolah Tinggi Teknik - PLN

The numerical method is a technique used to formulate mathematical problems so that it can be solved using ordinary arithmetic operations. In general, numerical methods are used to solve mathematical problems that cannot be solved by ordinary analytic methods. In the Numerical Method, we recognize two types of systems of equations, namely the Linear Equation System and the Non-Linear Equation System. Each system of equations has several methods. In the Linear Equation System between methods is the Gauss Elimination method, the Gauss-Jordan Elimination method, the LU (Lower-Upper) Decomposition method. And for Non-Linear Equation Systems between the methods are the Bisection method, the Regula Falsi method, the Newton Raphson method, the Secant method, and the Fix Iteration method. In this study, researchers are interested in analyzing 2 methods in the Non-Linear Equation System, the Newton-Raphson method and the Secant method. And this analysis process uses the Java programming language tools, this is to facilitate the analysis of method completion algorithm, and monitoring in terms of execution time and analysis of output results. So we can clearly know the difference between what happens between the two methods.

Implementation Of Bubble Sort Algorithm On 2 Fruit Models Of Data Selection Using The Java Program Language Endang Sunandar
PETIR Vol 14 No 2 (2021): PETIR (Jurnal Pengkajian Dan Penerapan Teknik Informatika)
Publisher : Sekolah Tinggi Teknik - PLN

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33322/petir.v14i2.946

There are various kinds of data sorting methods that we know of which are the Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Shell Sort, Heap Sort, and Radix Sort methods. All of these methods have advantages and disadvantages of each, whose use is determined based on needs. Each method has a different algorithm, where different algorithms affect the execution time. One interesting algorithm to be implemented on 2 variant models of data sorting is the Bubble Sort algorithm, the reason is that this algorithm has a fairly long and detailed process flow to produce an ordered data sequence from a previously unordered data sequence. Two (2) data sorting variant models that will be implemented using the Bubble Sort algorithm are: Ascending data sorting variants moving from left to right, and Descending data sorting variants moving from left to right. And the device used in implementing the Bubble Sort algorithm is the Java programming language.

Implementasi Algoritma Bubble Sort Terhadap 2 Buah Model Varian Pengurutan Data Menggunakan Bahasa Program Java Endang Sunandar; Indrianto Indrianto
PETIR Vol 13 No 2 (2020): PETIR (Jurnal Pengkajian Dan Penerapan Teknik Informatika)
Publisher : Sekolah Tinggi Teknik - PLN

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33322/petir.v13i2.1008

In the field of computer science the efforts made in solving a problem are to use systematic, logical, and strategic flow and steps. These steps are known as algorithms. So many algorithms exist for solving a particular problem. In connection with this paper the algorithm discussed is about the data sorting algorithm, among the few known are: Merge, Selection, Insertion, Bubble, Quick, Heap, Shell. All of these algorithms have advantages and disadvantages of each. One interesting algorithm to be implemented on 2 models of data sorting variants is the Bubble Sort algorithm, the reason is that this algorithm has a fairly long and detailed process flow to produce sequential data sequences from previously unsordered data sequences. And the purpose of implementing them using the language of the program is to be able to provide a translation picture of a complicated and long Bubble Sort algorithm that becomes easier and concise to solve using the program language, which in this case uses the Java program language. For ascending sequencing moving from left to right the method is by shifting the larger values to the right position in sequence, so that finally the smaller values are on the left, whereas for descending sorting moving from left to right the method is by shifting the smaller values to the right position in sequence, so that finally the larger values are on the left. And the programming technique differs only in relation operators that are used against the data being compared.

Co-Authors Ahmad Roihan Asep Saefullah Dendy Jonas Diah Aryani Dody Guntama Fajar Ramadhan Indrianto Indrianto Khanna Tiara Miswanto Miswanto Mohamad Daud Muhammad Asep Abdul Fatah Muhammad Nur Rifai Rahel Laurenta Endes Satrio Pramudito Sohir Uji Alman Sujiana Yogi Herdiana Yudha Qirana Meka

Title Search

Found 5 Documents Search Journal : Petir

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 5 Documents
Search
Journal : Petir