M. Oguz Ozcan

M. Oguz Ozcan

Software Engineer

Quick Sort Algorithm in Java

less than 1 minute read

Quick sort algorithm is a kind of divide and conquer algoritm. Quick sort is also known as Partition-exchange sort. There are three important elements in the quick sort.

  1. Pivot element
  2. Elements that are less than pivot
  3. Elements that are greater than pivot

Algorithm changes wrt to selection of the pivot. There are different approaches while selecting the pivot.

You May Also Enjoy

Unix vs. Linux

3 minute read

These two terms are always confused and I also was not aware of all the details. In this post, i am sharing the summary of what I learned during my research ...

SSH, TLS, Mosh, Tmux, Eternal Terminal

7 minute read

I was using iTerm2 and connecting to my devservers through “ssh address_of_server”, however i realized that if i try to open more than one connection for the...