Number of set bits in all numbers from 1 to n

Number of set bits in all numbers from 1 to n

Author: careermonk

.project

@@ -5,6 +5,11 @@
 	<projects>
 	</projects>
 	<buildSpec>
+		<buildCommand>
+			<name>org.python.pydev.PyDevBuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
 		<buildCommand>
 			<name>org.eclipse.jdt.core.javabuilder</name>
 			<arguments>
@@ -13,5 +18,6 @@
 	</buildSpec>
 	<natures>
 		<nature>org.eclipse.jdt.core.javanature</nature>
+		<nature>org.python.pydev.pythonNature</nature>
 	</natures>
 </projectDescription>

.pydevproject

@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<?eclipse-pydev version="1.0"?><pydev_project>
+<pydev_property name="org.python.pydev.PYTHON_PROJECT_INTERPRETER">Default</pydev_property>
+<pydev_property name="org.python.pydev.PYTHON_PROJECT_VERSION">python 2.7</pydev_property>
+</pydev_project>

bin/.gitignore

@@ -1,16 +1 @@
-/chapter01introduction/
-/chapter02recursionandbacktracking/
-/chapter03linkedlists/
-/chapter04stacks/
-/chapter05queues/
-/chapter06trees/
-/chapter07priorityqueues/
-/chapter08disjointsets/
-/chapter10sorting/
-/chapter11searching/
-/chapter12selectionalgorithms/
-/chapter15stringalgorithms/
-/chapter17greedyalgorithms/
-/chapter18divideandconquer/
-/chapter19dynamicprogramming/
 /chapter21miscconcepts/

src/chapter21miscconcepts/CountNumberofSetbitsin1toN.java

@@ -0,0 +1,29 @@
+/*Copyright (c) Dec 22, 2014 CareerMonk Publications and others.
+ * E-Mail           	: [email protected] 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: CheckEndian.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 chapter21miscconcepts;
+
+public class CountNumberofSetbitsin1toN {
+	public int countNumberofSetbitsin1toN(int n) {
+		long i = 0, j, count = 0; 
+		for (i = 1; i<=n; i++){
+			j = i;
+			while(j>0) {
+			     count++;
+			     j = j & (j - 1); 
+			}
+		}
+		return count;		
+	}
+}

src/chapter21miscconcepts/SquareMatrixRotationByOneElement.java

@@ -28,7 +28,7 @@ int[][] rotateByOneElementClockwise(int[][] matrix) {
                     // move left
                     roataedMatrix[i][j-1] = matrix[i][j];
                 } else if(i+j<=n-1 && i>j){
-                    // move top
+                    // move up
                     roataedMatrix[i-1][j] = matrix[i][j];
                 } else if(i+j>=n-1 && i<j) {
                     // move down