[algogeeks] opengl
please somebody suggest some good tutorial in animation in opengl using c++.. thanks in advance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] FUNCTION POINTER IN C
I have to pass a general array in a function whose type will also be passed and also a function pointer for or . e.g. void function(type , type array, pointer for or ) how will you write it in C? Thanxx in Advance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Divide 2 nos. without DIVISON
Given 2 nos. we need to divide them without performing divison. Please give a better solution than subtracting the nos. again and again. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] OpenGL
hey guys... please tell me how to run OpenGl on eclipse. thanxx in advance.. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] m-permutation
Suppose n people are arranged in a circle. Number the people from 1 to n. in the clockwise order. We are given an integer ,m = n. Beginning with the person with designated number 1, we proceed around the circle (in clockwise order) removing every mth person. After each person is removed, counting continues around the circle that remains. This process continues until all the n people have been removed. . The .m-permutation is defined as the order in which the people have been removed. As an example, if n = 7, m = 3, then the 3 - permutation is 3,6,2,7,5,1,4. Give an O(n log n) time algorithm which given m and n outputs the m- permutation. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Sparse Matrix multiplication
A nxn matrix is sparse if the number of non-zero entries in the matrix is much less than n^2. Multiply 2 nxn matrices containing L1, L2, non- zero entries is O(L1L2). -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Don't Sort
There are N students in a class. They got marks in a certain test. Teacher decides to give prize1 to top log(n) students and the next sqrt(n) students be given prize2. However, he has stipulated that we cannot sort the student roll list according to marks (which would take O(nlog(n)) time) but should use something to get the answer in O(n) time. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Chess Programming
Guys, please provide me some links where i can see chess designing algorithms. I am not worried about GUI. Thnxxx in advance -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Answer This
In an ancient village, there were some green-eyed and blue-eyed persons. One fi ne day, God instructed them, the day on which you come to know that you are a green-eyed, you should commit suicide ... He also assured them that there was at least one green-eyed among them. Well, all the villagers were very intelligent and strict followers of God. But, no one knew color of his own eyes! They didn't have mirrors. They couldn't even communicate with each other. All that they could do is to see color of other's eyes. It happened that on 20th day, all the green-eyed people committed suicide. So, how many green-eyed were there ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
