how to create a sort function ???

[Rahmat]

I want to sort information of some cars according to their ( ID )
but i can not create a function that do this work( sort ) for me !
can you help me to solve it ??
and also in showing information and search them in the file i have a big truble

i dont know why my functions dont work please answer me fast

here is my code

  // final project.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <fstream>
#include <iomanip>
#include <math.h>
#include <conio.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
					
using namespace std;
struct Pdate  // Produce date
{
	int year;
	int month;
	int day;
};
struct Car
{
	char name[30];
	char ID[10];
	char color[30];
	Pdate date;
};

char showMenu();
void getInfo(Car s[]);
void getInfoFile();
void showInformation();
void search();
void Editinfo();
void main()
{
	while (true)
	{
		char s;
		while(1)
		{
			s=showMenu();
			switch(s)
			{
			case '1' :
				system ("cls");
				getInfoFile();
				break;
			case '2' :
				showInformation();
				break;
			case '3' :
				search();
				break;
			case '4' :

				break;
			case '5' :
				return;
			default:
				cout<<"\n\n\n\t\t\t Error !!!!!! " ;
				_getch();
				break;
			}//switch
		}// 
	}
}//main

/*void getInfo(Car s[])
{
	static int index=0;
	cout<<" Enter Name :  " ;
	cin.getline(s[index].name,30);
	cin.getline(s[index].name,30);
	cout<<" What Is The Color of Car :  ";
	cin>>s[index].color;
	cout<<" Enter ID :  ";
	cin>>s[index].ID;
	cout<<" Enter production date [ year , month , day ] : ";
	cin>>s[index].date.year>>s[index].date.month>>s[index].date.day;
	index++;
}*/
void getInfoFile()
{
	Car s;
	fstream CarsInfo("cars.txt",ios::app);
	cout<<"\n	Enter Name of car: ";
	cin.getline(s.name,30);
	cin.getline(s.name,30);
	cout<<"\n	What Is The Color of Car : ";
	cin>>s.color;
	cout<<"\n	Enter ID of car: ";
	cin>>s.ID;
	cout<<"\n	Enter production date [ year , month , day ] : ";
	cin>>s.date.year>>s.date.month>>s.date.day;
	CarsInfo<<s.name<<" * " <<s.color<<" * "<<s.ID<<" * "<<s.date.year<<" "<<s.date.month<<" "<<s.date.day<<"\t\n\n";
}
char showMenu()
{
	char usreSelect;
	system("cls");
	cout<<"\n	";
	cout<<"\n	1 : Get Information " ;
	cout<<"\n	2 : Show information" ;
	cout<<"\n	3 : Search Information ";
	cout<<"\n	4 : Edit Information " ;
	cout<<"\n	0 : For Exit ";
	cout<<"\n\n	Enter your Selection  ::  ";
	cin>>usreSelect;
	return usreSelect;
}
void showInformation()
{
	char temp[20];
	int i=1;  //  for showing rows
	system("cls");
	fstream fp("cars.txt",ios::in);
	cout<< "Row	NAME	color	ID \n";
	while(! fp.eof() ) 
	{
		cout<<" "<<i++<<" ";
		fp>>temp;
		cout<<setw(10)<<temp<<" ";
		fp>>temp;
		fp>>temp;
		cout<<setw(10)<<temp<<" ";
		fp>>temp;
		fp>>temp;
		cout<<setw(10)<<temp<<endl;
}

_getch();
}
void search()
{
	system("cls");
	Car s[10];
	fstream CarsInfo("cars.txt",ios::in);
	for (int i = 0; i < 5; i++)
	{
			
			CarsInfo.open("cars.txt",ios::in);
			char w[10];
			cout<<"\n	enter id of wanted car : ";
			cin.getline(w,10,'0');
			if(strcmp(s[i].ID,w)==0)
			{
				cout<<"\n !! car found !! see informations below !!";
				cout<<"\n\n	"<<s[i].name<<" * "<<s[i].color<<" * "<<s[i].ID<<" * "
					<<s[i].date.year<<" "<<s[i].date.month<<" "<<s[i].date.day<<" !!";
	
			}
			else
				cout<<"\n	there is no car with entered info !?!";

	}

	_getch();
}

and this is the out put but just void getInfoFile() do his job right !!!!!

        1 : Get Information
        2 : Show information
        3 : Search Information
        4 : Edit Information
        0 : For Exit

        Enter your Selection  ::    

[sakonpure6]

Do you know how to "Bubble sort" ?

[Rahmat]

No I dont know what is it !!
can you explain it for me ??

[JLBorges]

Here is a program that sorts integers in ascending order (the comments in the code explain the algorithm):

#include <iostream>

// in an array of integers 'a' of size 'sz' (sz>0),
// find and return the position of the smallest element
std::size_t position_of_smallest_element( const int a[], std::size_t sz )
{
    std::size_t pos_smallest = 0 ;

    for( std::size_t i = 1 ; i < sz ; ++i )
        if( a[pos_smallest] > a[i] ) pos_smallest = i ;

    return pos_smallest ;
}

// in an array of integers 'a' of size 'sz' (sz>0),
// bring the smallest element to the front
void bring_smallest_element_to_front( int a[], std::size_t sz )
{
    std::size_t pos_smallest = position_of_smallest_element( a, sz ) ;

    // swap smallest element with the one at the front (at position zero)
    int temp = a[0] ;
    a[0] = a[pos_smallest] ;
    a[pos_smallest] = temp ;
}

// sort an array of integers 'a' of size 'sz'
void sort( int a[], std::size_t sz )
{
    if( sz < 2 ) return ; // only zero or one element, nothing to be done

    // bring the smallest element of the array to the front
    bring_smallest_element_to_front( a, sz ) ;

    // a[0] already contains the smallest elenent of the array
    // all that remains to be done is: sort the remaining elements of the array
    // the remaining elents start at a+1, and have a size of sz-1
    sort( a+1, sz-1 ) ;
}

int main()
{
    int a[] = { 6, 2, 8, 3, 7, 6, 1, 9, 7, 4, 2, 5, 3 } ;
    for( int v : a ) std::cout << v << ' ' ;
    std::cout << '\n' ;

    sort( a, sizeof(a) / sizeof( a[0] ) ) ;

    for( int v : a ) std::cout << v << ' ' ;
    std::cout << '\n' ;
}

http://coliru.stacked-crooked.com/a/914606d8b30ab61a

[Rahmat]

thank you