Rate of Growths Update

Rate of Growths Update

Author: careermonk

bin/chapter01introduction/LogNComplexityDown.class

@@ -0,0 +1,33 @@
+/*Copyright (c) Dec 25, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: LogNComplexityDown.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter01introduction;
+
+public class LogNComplexityDown {
+
+	public static void main(String[] args) {
+		int n = 19;
+		System.out.println(logNUp(n));
+	}
+	
+	public static int logNUp(int n){
+		int count = 0;
+		for (int i = n; i>0;){
+			count ++;
+			i = i / 2;
+		}
+		return count;
+	}
+
+}

bin/chapter01introduction/LogNComplexityUp.class

@@ -0,0 +1,33 @@
+/*Copyright (c) Dec 25, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: LogNComplexityUp.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter01introduction;
+
+public class LogNComplexityUp {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int n = 19;
+		System.out.println(logNUp(n));
+	}
+	
+	public static int logNUp(int n){
+		int count = 0;
+		for (int i = 1; i<n;){
+			count ++;
+			i = i *2;
+		}
+		return count;
+	}
+}

bin/chapter01introduction/NComplexity.class

@@ -0,0 +1,32 @@
+/*Copyright (c) Dec 25, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: NComplexity.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter01introduction;
+
+public class NComplexity {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int n = 19;
+		System.out.println(orderN(n));
+	}
+	public static int orderN(int n){
+		int count = 0;
+		for (int i = 1; i<n;){
+			count ++;
+			i = i+1;
+		}
+		return count;
+	}
+}