x = 1:0.1:10;
y = x.*log10(x);
plot(x,y);

.csharpcode, .csharpcode pre
{
font-size: small;
color: black;
font-family: consolas, “Courier New”, courier, monospace;
background-color: #ffffff;
/*white-space: pre;*/
}
.csharpcode pre { margin: 0em; }
.csharpcode .rem { color: #008000; }
.csharpcode .kwrd { color: #0000ff; }
.csharpcode .str { color: #006080; }
.csharpcode .op { color: #0000c0; }
.csharpcode .preproc { color: #cc6633; }
.csharpcode .asp { background-color: #ffff00; }
.csharpcode .html { color: #800000; }
.csharpcode .attr { color: #ff0000; }
.csharpcode .alt
{
background-color: #f4f4f4;
width: 100%;
margin: 0em;
}
.csharpcode .lnum { color: #606060; }

// Quicksort Algorithm

#include "stdafx.h"
#include <iostream>

void Quicksort(int arr[], int left, int right);
void PrintArray(void);

const int ArraySize = 9;
int A[ArraySize] = {1, 12, 5, 26, 7, 14, 3, 7, 2};

int _tmain(int argc, _TCHAR* argv[])
{
    // Print Unsorted Array
    std::cout << "Unsorted Array: " << std::endl;
    PrintArray();

    // Sort the array A using quicksort
    Quicksort(A, 0, ArraySize-1);

    // Print Sorted Array
    std::cout << std::endl << "Sorted Array: " << std::endl;
    PrintArray();

    std::cout << std::endl;
    std::cout << std::endl;
    return 0;
}

void PrintArray(void)
{
    int i;
    for(i = 0; i < ArraySize; i++)
    {

        std::cout << A[i] << " ";
    }
}

void Quicksort(int arr[], int left, int right)
{
      int i = left, j = right;
      int tmp;
      int pivot = arr[(left + right) / 2];

      // partition

      while (i <= j)
      {
            while (arr[i] < pivot)
                  i++;

            while (arr[j] > pivot)
                  j--;

            if (i <= j)
            {
                  tmp = arr[i];
                  arr[i] = arr[j];
                  arr[j] = tmp;
                  i++;
                  j--;
            }
      };

      // recursion 

      if (left < j)
            Quicksort(arr, left, j);

      if (i < right)
            Quicksort(arr, i, right);
}

.csharpcode, .csharpcode pre
{
font-size: small;
color: black;
font-family: consolas, “Courier New”, courier, monospace;
background-color: #ffffff;
/*white-space: pre;*/
}
.csharpcode pre { margin: 0em; }
.csharpcode .rem { color: #008000; }
.csharpcode .kwrd { color: #0000ff; }
.csharpcode .str { color: #006080; }
.csharpcode .op { color: #0000c0; }
.csharpcode .preproc { color: #cc6633; }
.csharpcode .asp { background-color: #ffff00; }
.csharpcode .html { color: #800000; }
.csharpcode .attr { color: #ff0000; }
.csharpcode .alt
{
background-color: #f4f4f4;
width: 100%;
margin: 0em;
}
.csharpcode .lnum { color: #606060; }

Linux is very exciting in the sense of its cost, capability, and communities. The linux I have used are Fedora 8, then Fedora 9, OpenSUSE, Ubuntu, OpenSolaris, DSL, and ArchLinux. I’ve also used FreeBSD, and Debian. Among all of these, Fedora 8, OpenSUSE 11.1, Arch Linux are my favorites. Fedora 8 is very customizable, OpenSUSE 11.1 is extremely user-friendly, Arch Linux is compact but relatively easy to use.

The variety Linux distributions are awesome, however it’s also the weakness of open source software development. Many corporations such as Novell, and Red Hat will never combine OpenSUSE and Fedora projects, and other “truly opened” Linux distros have different philosophies.

In my opinion, Linux operating systems are not very suitable for general public to be use as workstation… too much configuration and not much dedicated supports.

Linux communities often claim that Linux is safer and more stable than windows. I think linux is safer because most malicious websites only target IE browser and windows systems. And the stability of windows is not really that bad! I’ve never seen a “blue screen of death” since I stopped using software with bad reputations such as QQ(in China). With proper anti-virus and anti-spyware programs, it’s safe! Of course back in 2005, firefox, ie, and explorer crash quite often. But now, they have never crashed on me for once! And most industrial software such as AutoCAD, 3D Max only available on Windows. Although I don’t like Microsoft’s monopoly on commercial software market, I’ve to use windows for workstation. So… I might as well spend more time with windows.

2. make the binary file executable

3. Install AdbeRdr9.1.0-1_i486linux_enu.bin

To install Adobe Reader plugin for firefox or other browsers, do:

4. go to installation directory for Adobe Reader, in my case is “/opt/Adobe/Reader9/Browser”

5. execute “install_browser_plugin”

6. choose first option, but it might fail because it might not find plugin directory. So, create plugin by making directories  “/usr/lib/firefox/plugins” and “/usr/lib/mozilla/plugins”

It’s done. Enjoy.

The task is to implement a program in any language (I use java) that runs Insertion Sort, Merge Sort, Heap Sort, Quick Sort accordingly, and produce a table like:

——–

Data Size      100     1000     10000     100000

Insertion     (execution time)

Merge

Heap

Quick

———-

For execution time, I used java System library currentTimeMillis.

Here is the code a timer class: (The way of using it is quite straight forward…just sandwich the code segment between Start() and Stop() in main class, and get the result by subtracting them.)

Chaintus is my name. I think it’s pretty slick to pronounce, but check spell always gives me a red line right below it.

Chaintus is a OSU student major in CE. So far, I’m quite satisfied with my major.

The main purpose for this blog is to record my study progress in CS, CPE, ECEN, ENSC courses.