Merge branch 'master' into Reverse_a_number_in_python

Author: t2013anurag

.gitignore

@@ -1 +1,4 @@
 .DS_Store
+
+# Dependencies
+node_modules/

Applet in java/README.md

@@ -0,0 +1,4 @@
+Applet Programming with Animation
+
+When You run this code:
+on mouse click car(drawn on applet) will start moving (Animation in applet)

Applet in java/car.java

@@ -0,0 +1,167 @@
+import java.applet.*;
+import java.awt.*;
+import java.awt.event.*;
+public class car extends Applet implements Runnable,MouseListener
+
+
+{
+	int i=0,k=0,z=0;
+	public void paint(Graphics g)
+	{
+          int x[]={200+i,300+i,400+i,500+i,500+i,0+i,0+i,100+i};
+          int y[]={200,200,300,300,400,400,300,300};
+          g.setColor(Color.RED);
+          g.fillPolygon(x,y,8);
+          g.setColor(Color.BLUE);
+        g.drawPolygon(x,y,8);
+        g.setColor(Color.WHITE);
+        g.fillOval(80+i, 350, 80, 80);
+        g.fillOval(320+i, 350, 80, 80);
+        g.setColor(Color.GREEN);
+        g.drawOval(80+i, 350, 80, 80);
+        g.drawOval(320+i, 350, 80, 80);
+        int x1[]={200+i,300+i,380+i,120+i};
+        int y1[]={220,220,300,300};
+        
+        g.setColor(Color.DARK_GRAY);
+        g.fillPolygon(x1,y1,4);
+        g.setColor(Color.MAGENTA);
+        g.drawPolygon(x1,y1,4);
+        
+	}
+	void update()
+	{
+		
+		if(z%2!=0)
+		{
+		 i=(i+1)%getWidth();
+		}
+		if(z%2==0)
+		{
+
+			if(i==0)
+			{
+				i=getWidth();
+			}
+			i=(i-1);
+					
+		}
+		
+	}
+	
+	Thread t;
+	Thread t1;
+	public void init()
+	{
+		 t=new Thread(this);
+		//t.setDaemon(true); 
+		t1=new Thread(this);
+		//t1.setDaemon(true); 
+		addMouseListener(this);
+		
+        			
+	}
+	public void run()
+	{
+		if(z%2==0)
+		{
+			while(true)
+			{
+		update();
+			repaint();
+			try
+			{
+			  Thread.sleep(10);
+			}
+			catch(Exception e )
+			{
+				
+			}	
+								
+		}
+		}
+						
+			 if(z%2!=0)
+		{
+		while(true)
+		{
+		update();
+		repaint();
+		try
+		{
+		  Thread.sleep(10);
+		}
+		catch(Exception e )
+		{
+			
+		}
+		}
+		
+	}
+		
+	}
+		
+		public void mouseClicked(MouseEvent e)
+		{
+	
+			//if(k>0)
+			//{
+				//t.resume();
+			
+//			}
+			System.out.println("kkk = "+e);
+			int x=e.getX();
+			int y=e.getY();
+			
+           z++;
+			while(x>0&&x<getWidth())
+			{
+				
+				if(z%2!=0)
+				{		
+					System.out.println(x);
+				 t.start();
+				}
+				if(z%2==0)
+				{
+					System.out.println(x);
+					t1.start();
+				}
+				
+			}
+
+		
+	
+		}
+
+
+
+		@Override
+		public void mouseEntered(MouseEvent arg0) {
+			// TODO Auto-generated method stub
+			
+		}
+
+		@Override
+		public void mouseExited(MouseEvent arg0) {
+			// TODO Auto-generated method stub
+			
+		}
+
+		@Override
+		public void mousePressed(MouseEvent arg0) 
+		{
+			
+			
+		}
+		@Override
+		public void mouseReleased(MouseEvent arg0) 
+		{
+			
+		}
+
+		
+		
+		
+	
+}

BFS/BFS.cpp

@@ -6,8 +6,6 @@ vector<ll> gr[1010];
 
 void bfs(ll u,ll V,bool vis[])
 {
-
-
     queue<ll> q;
     vis[u]=true;
     q.push(u);
@@ -16,21 +14,20 @@ void bfs(ll u,ll V,bool vis[])
         ll ver=q.front();
         q.pop();
         cout<<ver<<" ";
-        for(ll i=0;i<gr[ver].size();i++)
-        if(!vis[gr[ver][i]]){
+        for(ll i=0; i<gr[ver].size(); i++)
+            if(!vis[gr[ver][i]])
+            {
                 vis[gr[ver][i]]=true;
                 q.push(gr[ver][i]);
-        }
+            }
     }
-
-
 }
 void bfsMain(ll src,ll V)
 {
-       bool vis[V];
+    bool vis[V];
     fill(vis,vis+V,false);
     bfs(src,V,vis);
-    for(ll i=0;i<V;i++)
+    for(ll i=0; i<V; i++)
         if(!vis[i])
             bfs(i,V,vis);
 }
@@ -51,16 +48,3 @@ int main()
     bfsMain(src,v);
     return 0;
 }
-/*
-8 9
-0 1
-0 2
-1 3
-2 4
-1 4
-3 4
-3 5
-4 5
-6 7
-0
-*/

BFS/README.txt

@@ -0,0 +1,9 @@
+Breadth First Traversal
+
+Breadth First Traversal for a graph is similar to Breadth First Traversal of a tree. 
+The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. 
+To avoid processing a node more than once, we use a boolean visited array. For simplicity, it is assumed that all vertices are reachable from the starting vertex.
+
+The dfsMain function is used for the case if all vertices are not reachable from the starting vertex.
+
+Time Complexity: O(V+E) where V is number of vertices in the graph and E is number of edges in the graph.

BST/createBST_From_sortedArray.cpp

@@ -0,0 +1,77 @@
+#include<iostream>
+#include<stack>
+using namespace std;
+
+// A BST node
+struct Node
+{
+	int data;
+	struct Node *left,*right;
+};
+
+// A utility function to create new Node
+Node* newNode(int val)
+{
+	Node* temp = new Node;
+	temp->data = val;
+	temp->left = temp->right = NULL;
+}
+
+Node* createBST(int arr[],int l,int r)
+{	
+	if(l>r)
+		return NULL;
+
+	int mid = (l+r)/2;
+
+	Node* root = newNode(arr[mid]);
+
+	root->left = createBST(arr,l,mid-1);
+	root->right  = createBST(arr,mid+1,r);
+
+	return root;
+
+}
+
+void inorderIterative(Node* root)
+{
+	stack<Node*> s;
+
+	Node* current = root;
+
+	while(1)
+	{
+		if(current)
+		{
+			s.push(current);
+			current = current->left;
+		}
+		else
+		{
+			if(!s.empty())
+			{
+				current = s.top();
+				s.pop();
+				cout<<current->data<<" ";
+				current = current->right;
+			}
+			else
+			{
+				break;
+			}
+		}
+
+	}
+}
+
+
+int main()
+{
+
+	int arr[] = {1,2 ,3 ,4 ,5 ,6, 7,8,9,10,11,12};
+	int size = sizeof(arr)/sizeof(arr[0]);
+
+	Node* root = createBST(arr,0,size-1);
+	
+	inorderIterative(root);
+}