1
DAFTAR PUSTAKA
Wilkinson, Barry dan Michael Allen. 2010. Tehcniques and Apllications Using Networked and Parallel Computers. Second editons :Terjemahan. Andi: Yogyakarta.
M. Shalahuddin, Rosa A.S. 2010. Modul Pembelajaran Algoritma dan Pemrograman . University of Houston,Texas, U.S.A.
Suryani, E.2006. Pemodelan dan Simulasi. Yogyakarta: Graha Ilmu.
Drozdek, A.2001. Data Structures and Algorithms in C+ +. Brooks/Cole Thomson Learning. California.USA.
Jon L. Bentley, M. Douglas mcllroy.1993. Engineering a Sort Function.Software-Practice and Experience, Vol 23(11).
Knuth, D.1998. The Art of Computer programing Sorting and Searching, 2nd edition. Vol 3. Addison-Wesley.
A. Aho, J. Hoperoft, J.Ullman.2000. “Data Structures and Algoritms”, Pearson India reprint
Fanani Ikhsan. 2011. Penggunaan ”Big O Notation” untuk Menganalisa Efisiensi Algoritma. Program Studi Teknik Informatika, Institut Teknologi Bandung.
Leiss Ernst L, 2007. A ProgrAmmer’s ComPAnionto Algorithm AnAlysis, University of Houston,Texas, U.S.A.
Mansi Rami. 2010.“Enhanced Quicksort Algorithm.” The International Arab Journal of Information Technology, Vol. 7, No. 2.
Munir Rinaldi, 2007, Algoritma dan Pemrograman, Informatika Bandung. Nugroho Andi, 2005, Pemrograman Berorientasi Objek, Informatika Bandung.
Triono Puji. 2010. Analisis Perbandingan Algoritma Sorting dan Searching. Yogyakarta: Fakultas Teknologi Industri Universitas Ahmad Dahlan.
Wahyudi Bambang. 2004. Struktur Data dan Algoritma. Yogyakarta: Andi Offset. Robert Lafae. 2003. Data Structures and Algoritms in Java, USA:Sams Publishing.
