Comments on: Data Structure Tutorial : Lesson 02 – Implementing Sorting Algorithms Part I http://maxotek.net/blog/data-structure-tutorial-lesson-2-implementing-sorting-algorithms-part-i-t185.html Technology Blog Wed, 17 Nov 2010 05:13:20 +0000 hourly 1 http://wordpress.org/?v=3.2.1 By: reuben oyamo http://maxotek.net/blog/data-structure-tutorial-lesson-2-implementing-sorting-algorithms-part-i-t185.html/comment-page-1#comment-43 reuben oyamo Wed, 01 Apr 2009 06:59:38 +0000 http://maxotek.net/blog/?p=185#comment-43 Good stuff here! keep it up. Kindly give some comments on quicksort, heapsort and mergesort. Good stuff here! keep it up. Kindly give some comments on quicksort, heapsort and mergesort.

]]> By: Chau Nguyen http://maxotek.net/blog/data-structure-tutorial-lesson-2-implementing-sorting-algorithms-part-i-t185.html/comment-page-1#comment-41 Chau Nguyen Fri, 05 Dec 2008 06:17:52 +0000 http://maxotek.net/blog/?p=185#comment-41 Sent me a mail to tell what do you think about my comment :D Bye Chau Nguyen Sent me a mail to tell what do you think about my comment :D

Bye
Chau Nguyen

]]> By: Chau Nguyen http://maxotek.net/blog/data-structure-tutorial-lesson-2-implementing-sorting-algorithms-part-i-t185.html/comment-page-1#comment-42 Chau Nguyen Fri, 05 Dec 2008 06:17:19 +0000 http://maxotek.net/blog/?p=185#comment-42 hi there, I'm Chau I read your Pikabot, it's great. Anyway, I looked the sorting algorithms, and read this I don't think Bubble, Selection, Shell, Insert Sort is not good enough !!! The fact that they are basic sort, which have O(n^2) Why don't you post Quick Sort (fastest: O(nlog(2,n)) longest:O(n^2)), Quicksort include choice privot O(nlog(n)), Counting Sort O(n*m) and Distribution Counting Sort O(n*log(m,n)) For example, you sort 1,000,000,000 number, the max number is 1,000,000 and m = 1,000 Bubble, Selection, Shell, Insert Sort fastest = 1 billion; longest = 10^18 = 1 billion billon. Quick Sort fastest =1000000000 ;longest nearly 30 billions Counting Sort = 1000000000 (1 billions) but require double memory Distribution Counting Sort = 1,000,000,000 *log(1000,1000000)= only 2 billions but don't need double memory like Counting Sort hi there, I’m Chau
I read your Pikabot, it’s great.
Anyway, I looked the sorting algorithms, and read this
I don’t think Bubble, Selection, Shell, Insert Sort is not good enough !!!
The fact that they are basic sort, which have O(n^2)
Why don’t you post Quick Sort (fastest: O(nlog(2,n)) longest:O(n^2)), Quicksort include choice privot O(nlog(n)), Counting Sort O(n*m) and Distribution Counting Sort O(n*log(m,n))
For example, you sort 1,000,000,000 number, the max number is 1,000,000 and m = 1,000
Bubble, Selection, Shell, Insert Sort fastest = 1 billion; longest = 10^18 = 1 billion billon.
Quick Sort fastest =1000000000 ;longest nearly 30 billions
Counting Sort = 1000000000 (1 billions) but require double memory
Distribution Counting Sort = 1,000,000,000 *log(1000,1000000)= only 2 billions but don’t need double memory like Counting Sort

]]>