Data Structure – Sorting Algorithms in Java

some notes about Sort algorithm and their performance measurements:

we need to pay attention to some concepts on how these algorithms are designed:

  1. linear — do the sort in place and take an array as a whole.
    1. Bubble Sort
    2. Selection Sort
    3. Insertion Sort
  2. divide and conquer — break the questions into smaller chunks
    1. Merge Sort
    2. Quick Sort

to measure performance

  1. number of swaps (Swap Methods)
  2. number of comparisons (Find methods )

to measure their orders: BIG- O notation

 

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s