Programming

Algoritma; Analisis dan Desain

---

Rating Anda tentang Buku ini!

---

Algorithms have a considerable share in the development of science and especially computer science, especially the creation of computer programs. Various writings in the form of books and articles that explore the problem of algorithms. Broadly speaking, these writings can be divided into two categories. First, writing algorithms that are organized according to the problem to be solved. The book will be divided into chapters that are titled according to the problem, for example a chapter on sorting algorithms, searching, tracing graphs, trees and so on. The advantage of this kind of writing is mainly in seeing the comparison of algorithms in solving the same problem, for example the "sorting" problem, there are various ways to sort data. The downside of this approach, however, is the lack of explanation of the design techniques of the algorithms. The second approach presents a paper that focuses more on algorithm design techniques. The paper is divided into sections (chapters) that describe design techniques, such as brute-force, divide-and-conquer, dynamic programming. In each chapter, algorithms for various problems are collected but have the same design basis. The author combines the two categories above, so that the chapters in the book are titled according to problems such as searching, sorting, graphs etc., but some chapters are titled based on design techniques such as divide-and-conquer, dynamic programming, recursion and backtracking, greedy algorithm.

Algoritma memiliki andil yang cukup besar dalam perkembangan ilmu dan terutama ilmu komputer, khusus-nya pembuatan program komputer. Berbagai tulisan berupa buku maupun artikel yang mengupas masalah Algoritma. Secara garis besar tulisan tersebut dapat dibagi menjadi dua kategori. Pertama menuliskan algoritma yang disusun menurut masalah yang akan diselesaikan. Buku akan di bagi ke dalam bab-bab yang diberi judul sesuai permasalahan, misalnya bab tentang algoritma pengurutan data (sorting), pencarian data (searching), penelusuran graph, pohon dan sebagainya. Keutamaan dari tulisan seperti ini terutama didalam melihat perbandingan algoritma didalam penyelesaian masalah yang sama, misalnya masalah “sorting”, ada berbagai cara untuk men-sort data. Kelemahan pendekatan ini, adalah kurangnya penjelasan tentang teknik perancangan (design) dari algoritma. Pendekatan kedua, menyajikan tulisan yang lebih fokus ke teknik disain algoritma. Tulisan di bagi ke dalam bagian (bab) yang menguraikan teknik disain, seperti brute-force, divide-and-conquer, dynamic peogramming. Pada setiap bab dikumpulkan algoritma dari berbagai masalah namun memiliki dasar rancangan yang sama. Penulis menggabungkan kedua kategori tersebut di atas, sehingga bab-bab dalam buku ada yang diberi judul sesuai masalah seperti searching, sorting, graph dsb, namun ada pula bab yang diberi judul berdasarkan teknik disain seperti divide-and-conquer, dynamic programming, recursion dan backtracking, greedy algorithm.

---

Ketersediaan

005.1 SUA a.1d	005.1 SUA a	Perpustakan UNDIPA (Rak Cadangan)	Tidak Dipinjamkan-No Loan
005.1 SUA a.2d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia
005.1 SUA a.3d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia
005.1 SUA a.4d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia
005.1 SUA a.5d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia
005.1 SUA a.6d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia
005.1 SUA a.7d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia
005.1 SUA a.8d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia
005.1 SUA a.9d	005.1 SUA a	Perpustakan UNDIPA (Rak E4)	Tersedia

Informasi Detail

Judul Seri

--

No. Panggil

005.1 SUA a

Penerbit

Bojonegoro : Madza Media., 2023

Deskripsi Fisik

x + 503 hlm.; 14.8 cm x 21 cm

Bahasa

Indonesia

ISBN/ISSN

978-623-130-294-6

Klasifikasi

005.1

Tipe Isi

Text dan Gambar

Edisi/Cetakan

Edisi/Cetakan Agustus 2023

Subjek

Algoritma
Pemrograman
eBook
Analisis dan Desain

Lampiran File