VB icon

Basic Sorts

Email
Submitted on: 1/1/2015 6:04:00 AM
By: Eli (from psc cd)  
Level: Beginner
User Rating: By 7 Users
Compatibility: C, C++ (general)
Views: 1445
 
     Great introduction for beginners to different sorts... Implements functions for a MinSort, BubbleSort, InsertionSort and ShellSort. All on an array of chars, with a specified complexity for each one. Good for beginners to study.
 

INCLUDE files:

Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
//**************************************
//INCLUDE files for :Basic Sorts
//**************************************
#include <iostream.h>
#include <string.h>
#include <conio.h>
code:
Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
				
//**************************************
// Name: Basic Sorts
// Description:Great introduction for beginners to different sorts... Implements functions for a MinSort, BubbleSort, InsertionSort and ShellSort. All on an array of chars, with a specified complexity for each one. Good for beginners to study.
// By: Eli (from psc cd)
//
// Inputs:n/a
//
// Returns:n/a
//
// Assumes:n/a
//
// Side Effects:n/a
//**************************************

//**********************************************
//
// Different sorting algorithms. All sorting an
// array of chars.
//
//**********************************************
#include <iostream.h>
#include <string.h>
#include <conio.h>
void MinSort(char*, int);
void BubbleSort(char*, int);
void InsertionSort(char*, int);
void ShellSort(char*, int);
int main()
{
 clrscr();
 char cr[] = "dcabrosterdeonmlk";
 cout << cr << endl;
 ShellSort(cr, strlen(cr));
 cout << cr << endl;
 return 0;
}
// Complexity: n^2
void MinSort(char* array, int n)
{
 int i, j, temp_index;
 char min;
 for (i=0; i < n-1; ++i)
 {
temp_index = i;
min = array[i];
for (j = i+1; j < n; ++j)
{
 if (array[j] < min)
 {
	 temp_index = j;
	 min = array[j];
 }
}
array[temp_index] = array[i];
array[i] = min;
 }
}
// Complexity: n^2
void BubbleSort(char* array, int n)
{
 int i, j;
 char temp;
 for (i = 0; i < n-1; ++i)
for (j = i+1; j > 0; --j)
 if (array[j] < array[j-1])
 {
	 temp = array[j];
	 array[j] = array[j-1];
	 array[j-1] = temp;
 }	
}
// Complexity: n^2
void InsertionSort(char* array, int n)
{
 int i, j;
 char temp;
 for (i=1; i < n; ++i)
 {
temp = array[i];
j = i-1;
while ((j >= 0) && (temp < array[j]))
{
 array[j+1] = array[j];
 j--;
}
array[j+1] = temp;
 }
}
// Complexity: n^1.2
void ShellSort(char* array, int n)
{
 int i, j, k, s, gap_cnt;
 char temp;
 int gaps[5];
 gaps[0] = 9; gaps[1] = 5; gaps[2] = 3; gaps[3] = 2; gaps[4] = 1;
 for (gap_cnt = 0; gap_cnt < 5; gap_cnt++)
 {
k = gaps[gap_cnt];
s = -k;
for (i = k; i < n; ++i)
{
 temp = array[i];
 j = i-k;
 if (s == 0)
 {
	 s = -k;
	 s++;
	 array[s] = temp;
 }
 while (temp < array[j] && j >= 0 && j <= n) // + Bound checking
 {
	 array[j+k] = array[j];
	 j = j-k;
 }
 array[j+k] = temp;
}
 }
}


Other 2 submission(s) by this author

 


Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Beginner category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)
 

Other User Comments


 There are no comments on this submission.
 

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)
 

To post feedback, first please login.