Surya Sujarwo, Surya
School of Computer Science, Bina Nusantara University Jln. K. H. Syahdan No. 9, Jakarta 11480, Indonesia

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

HYBRID QUICKSORT: AN EMPIRICAL STUDY Sujarwo, Surya
CommIT (Communication and Information Technology) Journal Vol 7, No 2 (2013): CommIT Vol.7 No. 2 Tahun 2013
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/commit.v7i2.582

Abstract

This article describes an empirical study of hybrid approach of quicksort algorithms. The hybrid approach uses various variations of quicksort partition algorithms in combination with cutoff to shellsort using several cutoff elements. The paper compares the running time performance of the existing quicksort partition algorithms with the proposed hybrid approachusing uniqueand duplicate elements. As a result, it is found that several the hybrid approaches performs faster than the existing algorithms for uniqueand duplicate elements.
Implementation Of L-System In Procedural City Generation Using Java Sujarwo, Surya; Salim, William; Yuwono, Ferry
ComTech: Computer, Mathematics and Engineering Applications Vol 1, No 2 (2010): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v1i2.2351

Abstract

Article discusses about the design and implementation of procedural content generation using java, especially the generation of virtual city. It is applied by using L-System to generate the elements of the city and also using some images as the base models. This method is proven to be more effective because it can produce almost unlimited variations of city in short amount of time without any needs to modify the application. The result of this application is a road map which can be used in many areas such as virtual reality, games, or other related purposes.
Percepatan Perhitungan Hasil Tes Sistem Online menggunakan Kompresi Database Sujarwo, Surya
ComTech: Computer, Mathematics and Engineering Applications Vol 4, No 2 (2013): ComTech
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/comtech.v4i2.2658

Abstract

The article explores the influence of database compression on processing time in generating online test results through experimental study. The study uses three level compressions consists of none, row and page in table used by online test system. The experiment shows that using page compression results in faster processing time and less space compared to none and row compression, and the optimal row for compression is between 1001 and 2000 rows. In summary, to reduce space usage and processing time, it is better to use page compression in user answer table of online test system and to group the participant in schedule so that users? answer will be between 1001 and 2000 rows.