Questions in: Algorithm

Vankin’s Mile is an American solitaire game played on an n ? n square grid. The
player starts by placing a token on any square of the grid. Then on each turn, the player moves
the token either one square to the right or one square down. The game ends when player moves
the token o the edge of the board. Each square of the grid has a numerical value, which could be
positive, negative, or zero. The player starts with a score of zero; whenever the token lands on a
square, the player adds its value to his score. The object of the game is to score as many points
as possible. For example, given the grid below, the player can score 8 − 6 + 7 − 3 + 4 = 10 points
by placing the initial token on the in the second row, and then moving down, down, right, down,
down. (This is not the best possible score for this grid of numbers.)
(a) Describe and analyze an ecient algorithm to compute the maximum possible score for a game
of Vankin’s Mile, given the n × n array of values as input.
(b) In the European version of this game, appropriately called Vankin?s Kilometer, the player
can move the token either one square down, one square right, or one square left in each turn.
However, to prevent infinite scores, the token cannot land on the same square more than
once. Describe and analyze an ecient algorithm to compute the maximum possible score for
a game of Vankin’s Kilometer, given the n × n array of values as input.

str='Have a nice day'
new_str=str.split(' ');
final_str=[]
for(let i = new_str.length-1;i>=0; i--){
final_str.push(new_str[i])
// console.log(i );
}
console.log(final_str.join(' '));

$str = explode(" ","have a nice day");
$array_rev = array_reverse($str);
echo implode(" ",$array_rev);

str = "have a nice day".split()
new_str = ""
for word in str:
new_str = word+ " " +new_str
print(new_str)

#include
#include

using namespace std;

int main()
{
string str = "This is example of string reverse";
cout<<"Original string is :"<<str<> word)
{
res = word + " " + res;
}
cout<<"Reverse string is :"<<res<<endl;
return 0;
}

getReverseSentence(sentence) {
return sentence.split(' ').reverse().join(' ');
}

public class Main
{
public static void main(String[] args) {
System.out.println("Hello World");
String name ="have a nice day";
String[] nameL= name.split(" ");
System.out.println(nameL[3] + " " + nameL[2] + " " + nameL[1] + " " + nameL[0]);
}
}

#include
#include
using namespace std;
string reversestr(string s,int i,int j)
{
char temp;
for(i;i<j;i++,j--)
{
temp=s[i];
s[i]=s[j];
s[j]=temp;
}
return s;
}

int main()
{
string s;
getline(cin,s);

int j=0;
int start=0;
while(j<=s.length())
{
if((int)s[j]==32||j==s.length())
{
s=reversestr(s,start,j-1);
start=j+1;
}

j++;
}
s= reversestr(s,0,(s.length()-1));
cout<<s;

}

#include
#include
#include

void reverse(char *a)
{
int i, j, size;
char tmp;

size = strlen(a);
j=size-1;

for(i=0; i<size/2; i++)
{
tmp=a[i];
a[i]=a[j];
a[j]=tmp;
j--;
}

}

void reverseAll(char *a)
{
int size;

reverse(a);

size = strlen(a);
char *new = (char*)malloc(size+1);

char *token = strtok(a, " ");
reverse(token);
strcpy(new, token);
printf("%s ", new);
while(token != NULL)
{
reverse(token);
token = strtok(NULL, " ");
strcat(new, token);
}

}

int main()
{
char a[15]= "have a nice day";

reverseAll(a);
printf("%s ", a);
return 0;
}