Penerapan Metode Divide-And-Conquer Dan Teknik Hashing Pada Penyelesaian Persoalan SPOJ 36671 Bipartite Permutation (Hard)

Ngo, Bryan Gautama (2022) Penerapan Metode Divide-And-Conquer Dan Teknik Hashing Pada Penyelesaian Persoalan SPOJ 36671 Bipartite Permutation (Hard). Other thesis, Institut Teknologi Sepuluh Nopember.

[thumbnail of 05111840000011-Undergraduate_Thesis.pdf] Text
05111840000011-Undergraduate_Thesis.pdf - Accepted Version
Restricted to Repository staff only until 1 April 2024.

Download (1MB) | Request a copy

Abstract

Bilangan 1 hingga N dapat dibagi menjadi dua partisi. Hal tersebut diangkat sebagai bahan persoalan dalam Sphere Online Judge “Bipartite Permutation (Hard)”, yang menjadi topik permasalahan dalam tugas akhir ini: Mencari suatu pembagian bilangan dari 1 hingga N, dengan ketentuan di mana jumlah dari setiap elemen pada partisi dengan nilai leksikografis terendah akan dilakukan proses hashing yang disertai metode divide and conquer. Proses hashing pada tugas akhir ini adalah proses pemetaan dari sebuah angka menjadi sebuah nilai hash dengan melewatkan angka tersebut ke dalam sebuah fungsi hash. Tugas akhir ini berhasil menyelesaikan permasalahan di atas dengan efisien, dengan rata-rata waktu 0.015 detik dengan penggunaan memori 5.07 MB.
================================================================================================
Numbers 1 to N can be divided into two partitions. This was raised as a matter of issue in the Sphere Online Judge "Bipartite Permutation (Hard)", which became the topic of the problem in this thesis: Finding a division of numbers from 1 to N, by the condition that the sum of each element in the partition with the lowest lexicographic value will undergo hashing process with the divide and conquer method. Hashing process in this thesis is the process of mapping from a certain number to a hash value by passing the number into a hash function.This thesis has been succeeded in solving the aforementioned problems efficiently, with an average time of 0.015 seconds with memory usage 5.07 MB.

Item Type: Thesis (Other)
Uncontrolled Keywords: divide and conquer, hashing, number theory, partisi, partition
Subjects: T Technology > T Technology (General) > T58.8 Productivity. Efficiency
Divisions: Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User: Bryan Gautama Ngo
Date Deposited: 02 Feb 2022 07:19
Last Modified: 01 Nov 2022 03:43
URI: http://repository.its.ac.id/id/eprint/92659

Actions (login required)

View Item View Item