Recursive Reverse String Algorithm
The Shortest function to reverse a string.
*/
#include <iostream>
using namespace std;
void ret_str(char* s)
{
if(*s != '\0')
ret_str(s+1);
cout<<*(s);
}
int main()
{
ret_str("born2c0de");
return 0;
}
Saturday, April 16, 2011
Browse » Home »
Algoritma dan Pemrograman ,
Belajar Struktur Data ,
Laporan Praktikum Algoritma dan Pemrograman
» Recursion Shortest Function to Reverse a String
Recursion Shortest Function to Reverse a String
/*
Recursive Reverse String Algorithm
The Shortest function to reverse a string.
*/
#include <iostream>
using namespace std;
void ret_str(char* s)
{
if(*s != '\0')
ret_str(s+1);
cout<<*(s);
}
int main()
{
ret_str("born2c0de");
return 0;
}
Recursive Reverse String Algorithm
The Shortest function to reverse a string.
*/
#include <iostream>
using namespace std;
void ret_str(char* s)
{
if(*s != '\0')
ret_str(s+1);
cout<<*(s);
}
int main()
{
ret_str("born2c0de");
return 0;
}
Subscribe to:
Post Comments (Atom)
Comments :
0 comments to “Recursion Shortest Function to Reverse a String”
Post a Comment