Article Per Year (5 Year)
p-Index From 2021 - 2026
1.197
P-Index
This Author published in this journals
All Journal Dinamik Building of Informatics, Technology and Science Jurnal Media Computer Science Malcom: Indonesian Journal of Machine Learning and Computer Science
Mahenra, Ridwan
Unknown Affiliation
Computer Science & IT

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

Found 3 Documents
Search
Journal : Dinamik

 1 
Comparasi Model DeepSeek dan OpenAI dalam Meningkatkan Efisiensi Pencarian Informasi pada Sistem Pencarian Algoritma Mahenra, Ridwan; Setiawan, Dandi
Dinamik Vol 31 No 1 (2026)
Publisher : Universitas Stikubank

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35315/dinamik.v31i1.10287

Abstract

This study evaluates the efficiency of two artificial intelligence models, DeepSeek and OpenAI, in generating code for algorithmic systems. Efficiency is assessed through execution speed, code accuracy, and the number of code characters produced. Data were collected from 100 tests covering search, sorting, graph, dynamic programming, optimization, data processing, text, and machine learning algorithms. The objective is to compare the performance of both models to support the development of efficient information retrieval systems. The method involves algorithm testing with statistical analysis of execution time, accuracy, and code length. Results indicate that DeepSeek has an average execution time of 28.74 seconds, slightly slower than OpenAI’s 28.49 seconds. However, DeepSeek’s accuracy (85.88%) surpasses OpenAI’s (85.03%). The average number of code characters is identical at 96.35 characters. The study concludes that DeepSeek excels in accuracy, while OpenAI is faster in certain cases, providing valuable insights for developers in selecting AI models for information retrieval applications.
Analisis Efektivitas Pembelajaran Bahasa Jepang Melalui Anime dan Buku Teks dengan Algoritma AI K-Means dan Decision Tree Al Farhan, M Haidar Amir; Mahenra, Ridwan
Dinamik Vol 31 No 1 (2026)
Publisher : Universitas Stikubank

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35315/dinamik.v31i1.10288

Abstract

The growing interest in learning the Japanese language in Indonesia, driven by popular culture such as anime, creates a need to understand the effectiveness of different learning media. The non-uniform effectiveness of media for each individual poses a major challenge. Therefore, this study aims to analyze the effectiveness of both anime and textbooks by segmenting learner profiles and identifying key determinants of success using an artificial intelligence approach. This research employed a quantitative method through a questionnaire survey of 120 respondents. The data were analyzed in two stages: the K-Means Clustering algorithm was used to group respondents into learner profiles, and the Decision Tree algorithm was used to identify the most significant factors that differentiate these profiles. The analysis successfully identified three distinct learner profiles: "Intensive & Adaptive Learner," "Flexible Learner," and "Passive Learner." The decision tree revealed that the perception of textbook effectiveness and the frequency of anime use are the strongest predictors in determining a learner's profile, more so than theoretical learning style preferences. It is concluded that media effectiveness is highly dependent on the learner's behavioral and perceptual profile, which underscores the importance of a personalized approach in language education technology.
Perbandingan Efisiensi Algoritma Sorting Hybrid untuk Data Skala Menengah Yuanggara, Virnu; Mahenra, Ridwan
Dinamik Vol 31 No 1 (2026)
Publisher : Universitas Stikubank

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35315/dinamik.v31i1.10337

Abstract

Penelitian ini mengevaluasi efisiensi tiga algoritma sorting hybrid, yaitu TimSort, IntroSort, dan Merge-Insertion Sort, pada dataset skala menengah yang memiliki jumlah elemen antara 10.000 hingga 1.000.000. Tujuan utama penelitian adalah untuk menganalisis performa algoritma berdasarkan waktu eksekusi, konsumsi memori, dan stabilitas, dengan pengujian dilakukan pada berbagai jenis dataset, termasuk data acak, terurut, hampir terurut, dan data dengan banyak elemen duplikat. Pengujian dilakukan melalui simulasi komputasi menggunakan bahasa pemrograman Python dalam lingkungan terkontrol untuk memastikan hasil yang konsisten. Dataset sintetis dibuat untuk mencerminkan kasus dunia nyata, seperti pengolahan log sistem, pengurutan data pelanggan dalam aplikasi e-commerce, atau pengolahan data sensor dalam sistem Internet of Things (IoT). Hasil pengujian menunjukkan bahwa TimSort memiliki performa unggul pada dataset hampir terurut dengan waktu eksekusi rata-rata 0,12 detik untuk 1.000.000 elemen, sedangkan IntroSort lebih cepat pada dataset acak dengan waktu 0,09 detik dan konsumsi memori rendah sekitar 120 MB. Merge-Insertion Sort menonjol dalam hal stabilitas, tetapi memerlukan memori lebih besar, yaitu sekitar 180 MB untuk dataset yang sama. Analisis mendalam menunjukkan bahwa pemilihan algoritma yang optimal sangat bergantung pada karakteristik dataset dan kebutuhan aplikasi, seperti kecepatan untuk data acak atau stabilitas untuk pengurutan data berurutan. Penelitian ini merekomendasikan TimSort untuk aplikasi yang memerlukan stabilitas tinggi, seperti pengolahan data transaksi keuangan, dan IntroSort untuk aplikasi yang mengutamakan kecepatan pada data acak, seperti analitik data real-time. Untuk pengembangan lebih lanjut, penelitian ini menyarankan eksplorasi optimasi paralel atau implementasi algoritma pada perangkat dengan sumber daya terbatas guna meningkatkan skalabilitas dan efisiensi.
Co-Authors Afiani, Nanda Al Farhan, M Haidar Amir Nida, Khoirun Prasetyo, Khoir Setiawan, Dandi Susanto, Erliyan Redi Wicaksono, Aditya Eka Putra Yuanggara, Virnu