#include #include #include #include using namespace std; bool nin(long unsigned int i,long unsigned int j,vector> last) { for(long unsigned int a=0;a nexts; public: bool end=false; linkedList(char pc) { c=pc; } /*static int getkey(vector lst, char c) { long unsigned int step=lst.size()/4; long unsigned int pos=lst.size()/2; do { if(pos>=lst.size()) { return -1; } if(lst[pos].c==c) return pos; if(lst[pos].c>c) pos-=step; else pos+=step; step/=2; }while(step>0); return -1; }*/ static int getkey(vector lst, char c) { long unsigned int pos=lst.size()/2; if(pos>=lst.size()) { return -1; } if(lst[pos].c==c) return pos; vector nlst; int cons=0; if(lst[pos].c>c) { for(int i=0;i=0) return getkey(nlst,c)+cons; else return -1; } static bool compare(const linkedList& a, const linkedList& b) { return a.c word) { if(word.size()==0) end=true; else { bool t=true; for(long unsigned int i=0;t&&i> search(vector> grid,long unsigned int i,long unsigned int j,vector> last={}) { cout<<"searching at character "<> res; if(end) { cout<<"This is the end of one word and res is therefore:\n"; res={{c}}; for(long unsigned int i=0;i0&&nin(i-1,j,last)) { cout<<"We can go up\n"; int k=linkedList::getkey(nexts,grid[i-1][j]); cout<<"character "<> nlast=last; nlast.insert(nlast.begin(),{i,j}); vector> temp=nexts[k].search(grid,i-1,j,nlast); cout<<"nexts[k] finished its search with "<0&&nin(i,j-1,last)) { cout<<"We can go left\n"; int k=linkedList::getkey(nexts,grid[i][j-1]); cout<<"character "<> nlast=last; nlast.insert(nlast.begin(),{i,j}); vector> temp=nexts[k].search(grid,i,j-1,nlast); cout<<"nexts[k] finished its search with "<> nlast=last; nlast.insert(nlast.begin(),{i,j}); vector> temp=nexts[k].search(grid,i+1,j,nlast); cout<<"nexts[k] finished its search with "<> nlast=last; nlast.insert(nlast.begin(),{i,j}); vector> temp=nexts[k].search(grid,i,j+1,nlast); cout<<"nexts[k] finished its search with "< nexts; start() { cout<<"start initialised\n"; } void sort() { cout<<"sorting from start\n"; std::sort(nexts.begin(),nexts.end(),&linkedList::compare); for(long unsigned int i=0;i> search(vector> grid) { cout<<"searching from start\n"; vector> res; long unsigned int szx=grid.size(); long unsigned int szy=grid[0].size(); cout<<"szx is "<> temp=nexts[k].search(grid,i,j); cout<<"nexts[k] finished its search with "; cout< word) { bool t=true; for(long unsigned int i=0;t&&i> grid={{'b','o','b','o'},{'y','c','y','c'}}; cout<<"Grid is:\n"; for(long unsigned int i=0;i> words={{'b','o','c','o'},{'b','o','c','y'}}; start st; cout<<"adding words\n"; for(long unsigned int i=0;i> res; try { cout<<"searching in the grid\n"; res=st.search(grid); }catch(...) { cout<<"catched"; } cout<<"printing the result\n"; cout<<"\nresult\n"; cout<

[challenge] Grid search