mass commit for the cpp impl. of homeworks

Author: sumeyyadede

.gitignore

@@ -0,0 +1 @@
+/out

README

@@ -1,2 +1 @@
-
 Introduction to Algorithms to Sumeyya

is_palindrome.py

@@ -15,8 +15,6 @@ def is_palindrome(string):
 				has_visited_odd = True
 	return True
 
-
-
 def main():
 	string = "TactCoa"
 	isp = is_palindrome(string)

is_permutation.cpp

@@ -23,27 +23,19 @@ bool isPermutationHT(string str1,string str2){
 
 	char* cstr2 = (char*) str2.c_str();
 	for(int i=0; i<str2.length(); i++){
-
-		if(ht[cstr2[i]] != 0){
-			ht[cstr2[i]] = ht[cstr2[i]] - 1;
+		ht[cstr2[i]] = ht[cstr2[i]] - 1;
 
 		 if(ht[cstr2[i]] < 0){
 		 	return false;
 		 }
-		}
-
-		else {
-			return false;
-		}
-		
-		return true;
 	}
+	return true;
 }
 
 int main(int argc, char **argv){
 
-	string string1 = "sumyeya";
-	string string2 = "suymeya";
+	string string1 = "syyueya";
+	string string2 = "suyyeya";
 
 	cout << isPermutationHT(string1,string2) << endl;
 

one_way.py

@@ -1,7 +1,8 @@
+
 def one_way(string1, string2):
 	l1 = len(string1)
 	l2 = len(string2)
-	if abs(l1 - l2) > 1:
+	if abs(l1 - l2) > 1:  
 		return False
 	has_operated = False
 	i = 0
@@ -20,8 +21,8 @@ def one_way(string1, string2):
 	return True
 
 def main():
-	string1 = "pales"
-	string2 = "pale"
+	string1 = "pale"
+	string2 = "paske"
 	iow = one_way(string1, string2)
 	print(iow)
 

rotate_matrix.cpp

@@ -0,0 +1,64 @@
+#include <iostream>
+
+using namespace std;
+
+bool rotate(int **matrix,int len){
+
+	if(len == 0){
+	//((matrix.sizeof())/(matrix[0].sizeof()))){
+		return false;
+	}
+
+	for(int layer=0; layer<len/2; layer++){
+		cout << "layer " << layer << endl;
+		int first=layer;
+		int last=len-1-layer;
+
+		for(int i=first; i<last; i++){
+			int offset = i-first;
+			int temp;
+			printf("offset %d\n", offset);
+
+			//keep the top
+			temp = matrix[first][i];
+			//left to top;
+			matrix[first][i] = matrix[last-offset][first];
+			//bottom to left
+			matrix[last-offset][first] = matrix[last][last-offset];
+			//right to bottom
+			matrix[last][last-offset] = matrix[i][last];
+			//temp to right
+			matrix[i][last] = temp; 
+	    }
+	}
+	return true;
+}
+
+int main(){
+
+	int **matrix;
+	int len = 4;
+	matrix = new int *[len];
+	for (int i = 0; i < len; i++) {
+		matrix[i] = new int[len];
+		for (int j = 0; j < len; j++) {
+			matrix[i][j] = i * len + j;
+		}
+	}
+	for (int i = 0; i < len; i++) {
+		for (int j = 0; j < len; j++) {
+			cout << matrix[i][j] << "\t";
+		}
+		cout << endl;
+	}
+	rotate(matrix,len);
+
+	for (int i = 0; i < len; i++) {
+		for (int j = 0; j < len; j++) {
+			cout << matrix[i][j] << "\t";
+		}
+		cout << endl;
+	}
+
+	return 0;
+}

rotate_matrix.py

@@ -0,0 +1 @@
+rotate_matrix.py