Finite Automation

Given a Binary search tree, write a recursive function that
searches for key K , then write an iterative function.

Dear Fans, are you ready for algorithms mania.
we have 2 simple problems for this week

1) Write a method that takes a sorted array A of integers and a key K and returns the index of first occurrence of K in array A. Return -1 if K does not appear in A. Write tests to verify your code.

2) Design an efficient algorithm that finds the index of the first occurrence of an element that is larger than a key K; return -1 if every element is less than K

Our member Ahmed Fahim just won in "INJAZ" start up competition with our fan AbdEl-Rahman AbdEl-kawy who developed ITreat product

We will introduce an Algorithms 101 competition for our fans by 1st of December.

Get ready for some brand new stuff by next week ;)

Please welcome our newest memeber Mohamed AbdelAzim joining Finite Automation's family.

check our team member Ahmed ElGhoroury's new peom under the name of "in the air" in The Butterfly Theory magazine.

It is in the air : The Butterfly Theory It is in the air

Did you know that in the first public appearance for Finite Automation team members they won the 2nd Trustious HQ Contest, with the help of the amazing Ahmed Adel and the amazing Ayman Emam
The Final Ranking

Ahmed Fahim enjoying his prize at Trustious ;)

We would like to congratulate our team member and Co-Founder Ahmed Fahim for winning the 2nd place in Trustious competition ;)

We would like to congratulate our selves and all of you for hitting 100 Likes in 2 days :)
Stick around for more news very soon :)