CareerCup

#include <iostream>
using namespace std;

void str_reverse(char *str) {
	int sz = strlen(str);
	
	for (int i = 0; i < (sz/2); i++) {
		char tmp = str[i];
		str[i] = str[sz-i-1];
		str[sz-i-1] = tmp;
	}
}

int main() {
	char test[] = "abcdefgh";
	str_reverse(test);
	cout << test << endl;

	return 0;	
}

swap the characters.

swap the chars using + or xor operator w/o using any extra space.
e.g. in java.

public static char[] reverse(char[] in){
		for(int i = in.length-1, j=0; (i-j) > 0; j++, i--){
			in[j] = (char)((int) in[j] + (int) in[i]);
			in[i] = (char) ((int)in[j] - (int)in[i]);
			in[j] = (char) ((int)in[j] - (int)in[i]);
		}
		return in;
	}

can someone explain the problem .. am not gettin it

jbong's method is better for space complexity. We can improve speed by moving declaration of tmp out of for loop.
mast's - type casting from char to int will it not create temporary variables in memory?

Common people lets not paste stupid problems here ..

while(indexStart < indexEnd)
{
swap(array[indexStart],array[indexEnd]);
indexStart++;
indexEnd--;
}

while(indexStart < indexEnd)
{
swap(array[indexStart],array[indexEnd]);
indexStart++;
indexEnd--;
}

while(indexStart < indexEnd)
	{
		swap(array[indexStart],array[indexEnd]);
		indexStart++;
		indexEnd--;
	}