Text

Data Structures and Algorithm Analysis in C

---

Previously, it's only used bubble sort sorting algorithm. We try to compare the bubble sort algorithm with selection sort and quick sort to determine the quickest algorithm by searching the worst case (slowest execution time per unit) and best case (fastest execution time per unit). The result is quick < selection < bubble. Selection sort algorithm is proven to be the quickest when n < 26. But the cademic advisor data that are used in the utility is more than 26. So in this research, the quicksort algorithm is the fastest algorithm

---

Ketersediaan

78214

005.73 WEI D

Library Lantai 3

Tersedia

Informasi Detil

Judul Seri

-

No. Panggil

005.73 WEI D

Penerbit

California 94065 : The Benjamin/Cummings Publishing., 1992

Deskripsi Fisik

461 hlm

Bahasa

English

ISBN/ISSN

0-201-45573-0

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

1

Subyek

Data Structures

Info Detil Spesifik

-

Pernyataan Tanggungjawab

-

Versi lain/terkait

Lampiran Berkas

Komentar

---

You must be logged in to post a comment