Does someone have tutorial and some source code (insert + delete item) ???
Does someone have tutorial and some source code (insert + delete item) ???
You mean like there isn't one on the web already? <boggle>
If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
If at first you don't succeed, try writing your phone number on the exam paper.
http://en.wikipedia.org/wiki/AVL_tree
For instance
>Does someone have tutorial and some source code (insert + delete item) ???
I see you searched the forums thoroughly before asking this question.So as to save you from finding a really crappy tutorial, I'll direct you to a tutorial that I think is good.
My best code is written with the delete key.
Some of us do too.that I think is good
By the way, eternallyconfuzzled.com/tuts/avl.html#unbounddel >> search "tuorial".
Code:#include <stdio.h> void J(char*a){int f,i=0,c='1';for(;a[i]!='0';++i)if(i==81){ puts(a);return;}for(;c<='9';++c){for(f=0;f<9;++f)if(a[i-i%27+i%9 /3*3+f/3*9+f%3]==c||a[i%9+f*9]==c||a[i-i%9+f]==c)goto e;a[i]=c;J(a);a[i] ='0';e:;}}int main(int c,char**v){int t=0;if(c>1){for(;v[1][ t];++t);if(t==81){J(v[1]);return 0;}}puts("sudoku [0-9]{81}");return 1;}
