Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
sorting using array and pointer
#include <iostream> #include <algorithm> using namespace std; int main() { int len; string name[] = {"samuel", "david", "moses", "joy", "joshua"}; string *pin = name; len=sizeof(name)/sizeof(name[0]); sort(name,name+len); for(int i =0; i <len; i++) cout<<* (pin +i)<<endl; }
run
|
edit
|
history
|
help
0
Function to m_function
search_n algorithm
IndiSort
void sun()
Shortest path in binary tree
KJ
StrStrPbrk
Widget Class with dynamic memory and pointers
temp_new
TempQuickDoubArray