CodingUnit Programming Tutorials » Programming Algorithms

Cocktail Sort Algorithm or Shaker Sort Algorithm

admin — Sun, 01 Nov 2009 12:12:55 +0000

In this tutorial we look at another sorting algorithm named cocktail sort. Cocktail sort is a slight variation of bubble sort. Many Names of Cocktail Sort People have given many different names to cocktail sort, but they all the same. The following names are used: Shaker sort Bi-directional sort Cocktail shaker sort Shuttle sort Happy [...]

Cocktail Sort Algorithm or Shaker Sort Algorithm is a post from: CodingUnit Programming Tutorials

Exclusive-OR (XOR) Encryption

admin — Tue, 21 Jul 2009 10:15:39 +0000

Exclusive-OR (XOR) encryption is an encryption method that is hard to break through with so called “brute force” methods (brute force = using random encryption keys in the hope you find the correct one.), but the encryption method is susceptible to pattern recognition. Patterns can be easily avoided by first compressing the file (compression already [...]

Exclusive-OR (XOR) Encryption is a post from: CodingUnit Programming Tutorials

Shell Sort Algorithm

admin — Tue, 21 Jul 2009 10:11:54 +0000

An inventor called DL Shell came up with a very interesting sort which he called shell sort. This sorting algorithm is almost similar to the bubble sort algorithm. The shell sort compares elements that are a certain distance away (d positions away) from each other and it compares these elements repeatedly (bubble sort only compares [...]

Shell Sort Algorithm is a post from: CodingUnit Programming Tutorials

Insertion Sort Algorithm

admin — Tue, 21 Jul 2009 10:09:31 +0000

The insertion sort only passes through the array once. Therefore it is a very fast and efficient sorting algorithm with small arrays. (The efficiency is lost however with large amounts of data.) The sort works as follows: the array is split into two (virtual) sub-arrays. (With virtual I mean that the array is not really [...]

Insertion Sort Algorithm is a post from: CodingUnit Programming Tutorials

Selection Sort Algorithm

admin — Tue, 21 Jul 2009 10:06:36 +0000

The selection sort is using a combination of searching and sorting. Each unsorted element that has the smallest or largest value is moved to the proper position. The inner loop (see the example) is used for the selection and this loop is searching for the smallest or largest value. The outer loop is used for [...]

Selection Sort Algorithm is a post from: CodingUnit Programming Tutorials

Exchange Sort Algorithm

admin — Tue, 21 Jul 2009 10:00:02 +0000

The exchange sort is almost similar as the bubble sort. In fact some people refer to the exchange sort as just a different bubble sort. (When they see the source they even call it a bubble sort instead of its real name exchange sort.) The exchange sort compares each element of an array and swap [...]

Exchange Sort Algorithm is a post from: CodingUnit Programming Tutorials

Bubble Sort Algorithm

admin — Tue, 21 Jul 2009 09:46:28 +0000

The bubble sort gets its name because as array elements are sorted they gradually “bubble” to their proper positions, like bubbles rising in a glass of soda. A bubble sort will compare two adjacent element of an array and will swap them if they are out of order. The compare starts with the first and [...]

Bubble Sort Algorithm is a post from: CodingUnit Programming Tutorials