Ad:

C++ Discussion Thread
Unsolved
Views: 672

Sep 8th, 2008

Help! I need a little help starting this project its my final

Expand Post »

CIS350 Project
Choose one O(n log n) and one O(n2) sorting algorithm. Choose a third algorithm of any time complexity. For each of the three algorithms you have chosen, implement the algorithm.
Then, write a short piece of code that will generate the following:
1. A file of 1000 random integers
2. A file of 10000 random integers
3. A file of 100000 random integers
Run your three sorting routines and, using C++ library functions, time the execution of each of the three routines on the three data sets. Graph the results. Then, write a brief analysis and summary of the results.

Similar Threads

Computer Science Final Year Project Ideas in Computer Science
I need some ideas for my graduation project in Computer Science
Final Year Project help!!! in Computer Science
FYP Project Ideas... in Computer Science
last year degree hons project CA computer applications in Computer Science

sanfan49er

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

18 posts
since Mar 2008

Permalink

Sep 8th, 2008

Re: Help! I need a little help starting this project its my final

Click to Expand / Collapse Quote originally posted by sanfan49er ...

CIS350 Project
Choose one O(n log n) and one O(n2) sorting algorithm. Choose a third algorithm of any time complexity. For each of the three algorithms you have chosen, implement the algorithm.
Then, write a short piece of code that will generate the following:
1. A file of 1000 random integers
2. A file of 10000 random integers
3. A file of 100000 random integers
Run your three sorting routines and, using C++ library functions, time the execution of each of the three routines on the three data sets. Graph the results. Then, write a brief analysis and summary of the results.

What's the question? No one is going to do the whole thing for you without any effort on your part.
http://www.daniweb.com/forums/announcement8-2.html

VernonDozier

Featured Poster

Reputation Points: 2614

Solved Threads: 687

Posting Expert

Offline

5,375 posts
since Jan 2008

Permalink

Sep 10th, 2008

Re: Help! I need a little help starting this project its my final

Search for quick sort and bubble sort , this will help you finish your final year project assignment.

ithelp

Reputation Points: 769

Solved Threads: 128

Banned

Offline

1,910 posts
since May 2006

Permalink

Sep 10th, 2008

Re: Help! I need a little help starting this project its my final

Go eat a can and put your best effort in to it.

Dannyo329

Reputation Points: 20

Solved Threads: 8

Junior Poster in Training

Offline

79 posts
since Apr 2008

Permalink

Sep 10th, 2008

Re: Help! I need a little help starting this project its my final

Try and start it at least. I think an array of a bunch of numbers would work fine, user inputs the amount of numbers to be generated (to show your professor it works you can input 1000, 10000, and 100000) and then the output is a bunch of numbers from the array.

MelechM

Reputation Points: 11

Solved Threads: 6

Junior Poster in Training

Offline

55 posts
since Sep 2008

Permalink

Sep 11th, 2008

Re: Help! I need a little help starting this project its my final

try the following for a buble sort Ascenting. I think that will help you.All im doing is swaping the values, just like a swap algorithm.

Happy Coding!

C++ Syntax (Toggle Plain Text)
private: System::Void btnSort_Click(System::Object^  sender, System::EventArgs^  e) 
		 {
 
lsv->Items->Clear();
int temp;
String^ Stemp;
float ftemp;
 
for ( int i = 1;i < Employee_sum;i++ )
{
  for ( int j = Employee_sum- 1; j >= i; j--)
  {
if ((employee[j-1]->GetAFM()) > (employee[j]->GetAFM()))
{
				temp = employee[j-1]->GetAFM();
				employee[j-1]->SetAFM(employee[j]->GetAFM());
				employee[j]->SetAFM(temp);
 
				Stemp = employee[j-1]->GetLName();
				employee[j-1]->SetLName(employee[j]->GetLName());
				employee[j]->SetLName(Stemp);
 
				Stemp = employee[j-1]->GetFName();
				employee[j-1]->SetFName(employee[j]->GetFName());
				employee[j]->SetFName(Stemp);
 
				temp = employee[j-1]->GetSalary();
				employee[j-1]->SetSalary(employee[j]->GetSalary());
				employee[j]->SetSalary(temp);
 
				ftemp = employee[j-1]->GetTax();
				employee[j-1]->SetTax(employee[j]->GetTax());
				employee[j]->SetTax(ftemp);
 
				ftemp = employee[j-1]->GetIKA();
				employee[j-1]->SetIKA(employee[j]->GetIKA());
				employee[j]->SetIKA(ftemp);
 
				ftemp = employee[j-1]->GetTEBE();
				employee[j-1]->SetTEBE(employee[j]->GetTEBE());
				employee[j]->SetTEBE(ftemp);
 
				ftemp = employee[j-1]->GetNet();
				employee[j-1]->SetNet(employee[j]->GetNet());
				employee[j]->SetNet(ftemp);
				}
	}
	}
}
private: System::Void btnSort_Click(System::Object^  sender, System::EventArgs^  e) 
		 {

lsv->Items->Clear();
int temp;
String^ Stemp;
float ftemp;

for ( int i = 1;i < Employee_sum;i++ )
{
  for ( int j = Employee_sum- 1; j >= i; j--)
  {
if ((employee[j-1]->GetAFM()) > (employee[j]->GetAFM()))
{
				temp = employee[j-1]->GetAFM();
				employee[j-1]->SetAFM(employee[j]->GetAFM());
				employee[j]->SetAFM(temp);

				Stemp = employee[j-1]->GetLName();
				employee[j-1]->SetLName(employee[j]->GetLName());
				employee[j]->SetLName(Stemp);

				Stemp = employee[j-1]->GetFName();
				employee[j-1]->SetFName(employee[j]->GetFName());
				employee[j]->SetFName(Stemp);

				temp = employee[j-1]->GetSalary();
				employee[j-1]->SetSalary(employee[j]->GetSalary());
				employee[j]->SetSalary(temp);

				ftemp = employee[j-1]->GetTax();
				employee[j-1]->SetTax(employee[j]->GetTax());
				employee[j]->SetTax(ftemp);

				ftemp = employee[j-1]->GetIKA();
				employee[j-1]->SetIKA(employee[j]->GetIKA());
				employee[j]->SetIKA(ftemp);

				ftemp = employee[j-1]->GetTEBE();
				employee[j-1]->SetTEBE(employee[j]->GetTEBE());
				employee[j]->SetTEBE(ftemp);

				ftemp = employee[j-1]->GetNet();
				employee[j-1]->SetNet(employee[j]->GetNet());
				employee[j]->SetNet(ftemp);
				}
	}
	}
}

Alexpap

Reputation Points: 11

Solved Threads: 12

Junior Poster

Offline

117 posts
since Sep 2008

Permalink

Sep 11th, 2008

Re: Help! I need a little help starting this project its my final

try the following for an Ascenting buble sort . I think that will help you.All im doing is swaping the values, just like a swap algorithm.

Happy Coding!

C++ Syntax (Toggle Plain Text)
private: System::Void btnSort_Click(System::Object^  sender, System::EventArgs^  e) 
		 {
 
lsv->Items->Clear();
int temp;
String^ Stemp;
float ftemp;
 
for ( int i = 1;i < Employee_sum;i++ )
{
  for ( int j = Employee_sum- 1; j >= i; j--)
  {
if ((employee[j-1]->GetAFM()) > (employee[j]->GetAFM()))
{
				temp = employee[j-1]->GetAFM();
				employee[j-1]->SetAFM(employee[j]->GetAFM());
				employee[j]->SetAFM(temp);
 
				Stemp = employee[j-1]->GetLName();
				employee[j-1]->SetLName(employee[j]->GetLName());
				employee[j]->SetLName(Stemp);
 
				Stemp = employee[j-1]->GetFName();
				employee[j-1]->SetFName(employee[j]->GetFName());
				employee[j]->SetFName(Stemp);
 
				temp = employee[j-1]->GetSalary();
				employee[j-1]->SetSalary(employee[j]->GetSalary());
				employee[j]->SetSalary(temp);
 
				ftemp = employee[j-1]->GetTax();
				employee[j-1]->SetTax(employee[j]->GetTax());
				employee[j]->SetTax(ftemp);
 
				ftemp = employee[j-1]->GetIKA();
				employee[j-1]->SetIKA(employee[j]->GetIKA());
				employee[j]->SetIKA(ftemp);
 
				ftemp = employee[j-1]->GetTEBE();
				employee[j-1]->SetTEBE(employee[j]->GetTEBE());
				employee[j]->SetTEBE(ftemp);
 
				ftemp = employee[j-1]->GetNet();
				employee[j-1]->SetNet(employee[j]->GetNet());
				employee[j]->SetNet(ftemp);
				}
	}
	}
}
private: System::Void btnSort_Click(System::Object^  sender, System::EventArgs^  e) 
		 {

lsv->Items->Clear();
int temp;
String^ Stemp;
float ftemp;

for ( int i = 1;i < Employee_sum;i++ )
{
  for ( int j = Employee_sum- 1; j >= i; j--)
  {
if ((employee[j-1]->GetAFM()) > (employee[j]->GetAFM()))
{
				temp = employee[j-1]->GetAFM();
				employee[j-1]->SetAFM(employee[j]->GetAFM());
				employee[j]->SetAFM(temp);

				Stemp = employee[j-1]->GetLName();
				employee[j-1]->SetLName(employee[j]->GetLName());
				employee[j]->SetLName(Stemp);

				Stemp = employee[j-1]->GetFName();
				employee[j-1]->SetFName(employee[j]->GetFName());
				employee[j]->SetFName(Stemp);

				temp = employee[j-1]->GetSalary();
				employee[j-1]->SetSalary(employee[j]->GetSalary());
				employee[j]->SetSalary(temp);

				ftemp = employee[j-1]->GetTax();
				employee[j-1]->SetTax(employee[j]->GetTax());
				employee[j]->SetTax(ftemp);

				ftemp = employee[j-1]->GetIKA();
				employee[j-1]->SetIKA(employee[j]->GetIKA());
				employee[j]->SetIKA(ftemp);

				ftemp = employee[j-1]->GetTEBE();
				employee[j-1]->SetTEBE(employee[j]->GetTEBE());
				employee[j]->SetTEBE(ftemp);

				ftemp = employee[j-1]->GetNet();
				employee[j-1]->SetNet(employee[j]->GetNet());
				employee[j]->SetNet(ftemp);
				}
	}
	}
}

[/QUOTE]

Alexpap

Reputation Points: 11

Solved Threads: 12

Junior Poster

Offline

117 posts
since Sep 2008

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in C++ Forum Timeline: comparing stings to string array values

Next Thread in C++ Forum Timeline: Dynamic array of pointers to structures - doubt

DaniWeb Message

Cancel Changes

User Name
Password