Rajith Cherian

First of all the performance for a piece of code can be measured by the time it takes and the memory it cosumes. I've been working on code optimization and memory management for over 8 months now and i've come up various scenarios how performance can be improved. Myth [LIST] …

Hey guys... find() would work if its a per-defined data type. Since you are having a structure ( user - defined data type you need implement your own find function [CODE] void Delete(std::string Name, std::vector<Person>& Book) { vector<Person>::iterator vItr = Book.begin(); while ( vItr != Book.end() ) { if ( …

India

The most efficient way for swapping whole numbers is int a = 10; int b = 15; a ^= b; b ^= a; a ^= b; y because xor is an assembly level instruction and its much faster than any move operation.

Why dont you override the OnOK and OnCancel functions.?? Then have a centralized closing function ( in the main dlg ) which calls all the close functions in each class.

Sorry Im not able to get your question. 1) Do you want to select an entire column by clicking on a cell??? 2) Or do you want to select the entire row by clicking on a cell??? If your question is No:2 u need to set a style for the …

For better performance if the no.of elements is very large us a large primary value as the hash key for better hashing.

Hey hacker9801 You could also take a look at SQLite. Its very fast and be easily integrated with C++

The code could look like [CODE] int nFirstNumber = 0; int nSecondNumber = 0; vector<int> vOddNumber; int nEvenSum = 0; int nSumOddSquare = 0; cout<<"Enter the first Number: "; cin>>nFirstNumber; cout<<"Enter the second Number greater than the first number:"; cin>>nSecondNumber; while ( nSecondNumber <= nFirstNumber ) { cout<<"Enter the second …

Hope you have tried... SeekTobegin()

As mentioned by bugmenot this is how you do it. [CODE] # include <iostream> # include <cmath> # include <iomanip> using namespace std; int main() { int score, days; char Y = 0; cout <<"Enter an assignment score and type 'Y' if it was late: "; cin >> score >> …

The best thing you ca try is a vector of strings [CODE] #include <vector> #include <string> using namespace std; int main() { vector<string> vFName; string strFName; for ( int i = 0; i < 100 ; i++ ) { //Get First name and store in strFName; strFName = "First Name"; …

Probably this might work for you [CODE] const string strDigit = "0123456789"; const string strFloat = ".0123456789"; string strInput; // This the input string. //// Logic int nPos = -1; if ( ( nPos = strInput.find_first_not_of( strDigit ) ) >= 0 ) { if ( ( nPos = strInput.find_first_not_of( strFloat …

One of the efficient way of sorting is using a multi map. Use the field on which to sort as the key. Fill the multi-map and retrieve it. Your data will be sorted

This is an unsigned integer type used to represent the sizes of objects. The result of the sizeof operator is of this type, and functions such as malloc and memcpy accept arguments of this type to specify object sizes. [B] Usage Note[/B]: size_t is the preferred way to declare any …

As I understand your problem there are two ways you could proceed... Scenario 1: If you are going to lookup ( search ) for words within the vector i would recommend you to do a little change in your data structure. try using a map instead of a vector... If …

W.r.t std::vector.... Especially while loading ( doing a push_back )if u already know the the number of elements to be inserted then u can reserve it before u start loading. Use the reserve(...) function.

Dude.. Try this #include <string> using namespace std;

These days the term 'Programmer' and 'Developer' is been used inter-changeably. Here is the difference between programmer and developer... [B] Programmer:[/B] One who write codes and do some amount of documentation and maintanence. [B]Developer: [/B]One who does analysis, design, implementation, coding, testing , maintanence and documentation.

Hi Everyone Im a Software developer working in VC++. My forte is memory management and performance enhancement. Im good with algorithms. Thats it.. This is me.. im looking forward to gain a lot from this forum and also share what i've learnt over the years. See u guys around