diff --git a/linear-regression(grade prediction).R b/R/linear-regression(grade prediction).R
similarity index 100%
rename from linear-regression(grade prediction).R
rename to R/linear-regression(grade prediction).R
diff --git a/README.md b/README.md
index ba93e10..256bb8b 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,53 @@
# [Hacktober-Open](https://client69.github.io/Hacktober-Open/)
## You can add some good algorithms (in any language) which can be helpful for competitive programmers. I will merge it with hacktoberfest-accepted label
+
+Welcome to **Open** — a community-driven collection of open source code, snippets, and small projects.
+This repository is designed to help **new contributors** learn, practice, and share useful code across different languages.
+
+All contributions are welcome! 🚀
+
+---
+
+## 📌 How You Can Contribute
+1. Fork this repository.
+2. Add your script, project, or snippet in the appropriate folder.
+ - Example: add a Python script in `/python/`
+ - Or create a small project inside `/projects/`
+3. Update the README in your folder (if needed).
+4. Make a Pull Request (PR).
+
+---
+
+## 📂 Repository Structure
+- `python/` → Python programs
+- `javascript/` → JavaScript programs
+- `algorithms/` → Common algorithms in any language
+- `projects/` → Small apps, CLI tools, or experiments
+- `docs/` → Guides, notes, or tutorials
+- `Rust/` → Rust programs
+- Or any other language of your choice. If the folder doesn't exist create one.
+ So the structure of repository remains consistent
+
+---
+
+## 🎯 Contribution Guidelines
+- Keep your code clean and well-documented.
+- Use meaningful file names (e.g., `fibonacci.py` not `script1.py`).
+- Add comments where necessary to help beginners understand.
+- If submitting a project, include a short `README.md` explaining how it works.
+
+---
+
+## 🏷 Hacktoberfest
+This repository is **Hacktoberfest-friendly** 💻🎉
+All accepted PRs will be labeled **hacktoberfest-accepted**.
+
+---
+
+## 📜 License
+This project is licensed under the MIT License — feel free to use the code anywhere with attribution.
+
## How to contribute
1) Fork this repo by clicking the fork button on the top right.
2) Clone the forked repo on your pc (open a terminal and run this command).
diff --git a/ArrayOfObject in Java b/c/ArrayOfObject in Java
similarity index 100%
rename from ArrayOfObject in Java
rename to c/ArrayOfObject in Java
diff --git a/Bubble_sort.c b/c/Bubble_sort.c
similarity index 100%
rename from Bubble_sort.c
rename to c/Bubble_sort.c
diff --git a/C_Program_to_Swap_Two_Numbers.c b/c/C_Program_to_Swap_Two_Numbers.c
similarity index 100%
rename from C_Program_to_Swap_Two_Numbers.c
rename to c/C_Program_to_Swap_Two_Numbers.c
diff --git a/CircularQueue.c b/c/CircularQueue.c
similarity index 100%
rename from CircularQueue.c
rename to c/CircularQueue.c
diff --git a/FactLargeNo.c b/c/FactLargeNo.c
similarity index 100%
rename from FactLargeNo.c
rename to c/FactLargeNo.c
diff --git a/HuffmanCoding.c b/c/HuffmanCoding.c
similarity index 100%
rename from HuffmanCoding.c
rename to c/HuffmanCoding.c
diff --git a/Insertion sort b/c/Insertion sort
similarity index 100%
rename from Insertion sort
rename to c/Insertion sort
diff --git a/JobSequencing b/c/JobSequencing
similarity index 100%
rename from JobSequencing
rename to c/JobSequencing
diff --git a/Palindrome Partition b/c/Palindrome Partition
similarity index 100%
rename from Palindrome Partition
rename to c/Palindrome Partition
diff --git a/Queue.c b/c/Queue.c
similarity index 100%
rename from Queue.c
rename to c/Queue.c
diff --git a/Stack.c b/c/Stack.c
similarity index 100%
rename from Stack.c
rename to c/Stack.c
diff --git a/Taskmanager.c b/c/Taskmanager.c
similarity index 100%
rename from Taskmanager.c
rename to c/Taskmanager.c
diff --git a/binary_search.c b/c/binary_search.c
similarity index 100%
rename from binary_search.c
rename to c/binary_search.c
diff --git a/binarytree.c b/c/binarytree.c
similarity index 100%
rename from binarytree.c
rename to c/binarytree.c
diff --git a/bubbleSort b/c/bubbleSort
similarity index 100%
rename from bubbleSort
rename to c/bubbleSort
diff --git a/clone b/c/clone
similarity index 100%
rename from clone
rename to c/clone
diff --git a/clone-graph b/c/clone-graph
similarity index 100%
rename from clone-graph
rename to c/clone-graph
diff --git a/cloning b/c/cloning
similarity index 100%
rename from cloning
rename to c/cloning
diff --git a/combinationFormula.c b/c/combinationFormula.c
similarity index 100%
rename from combinationFormula.c
rename to c/combinationFormula.c
diff --git a/double_linked_list.c b/c/double_linked_list.c
similarity index 100%
rename from double_linked_list.c
rename to c/double_linked_list.c
diff --git a/efficientExponent.c b/c/efficientExponent.c
similarity index 100%
rename from efficientExponent.c
rename to c/efficientExponent.c
diff --git a/graph_ques b/c/graph_ques
similarity index 100%
rename from graph_ques
rename to c/graph_ques
diff --git a/greedyalgorithum.c b/c/greedyalgorithum.c
similarity index 100%
rename from greedyalgorithum.c
rename to c/greedyalgorithum.c
diff --git a/guessTheNumber.c b/c/guessTheNumber.c
similarity index 100%
rename from guessTheNumber.c
rename to c/guessTheNumber.c
diff --git a/infix-to-postfix.c b/c/infix-to-postfix.c
similarity index 100%
rename from infix-to-postfix.c
rename to c/infix-to-postfix.c
diff --git a/insertionsort.c b/c/insertionsort.c
similarity index 100%
rename from insertionsort.c
rename to c/insertionsort.c
diff --git a/is_real_number.c b/c/is_real_number.c
similarity index 100%
rename from is_real_number.c
rename to c/is_real_number.c
diff --git a/linked_list.c b/c/linked_list.c
similarity index 100%
rename from linked_list.c
rename to c/linked_list.c
diff --git a/manojbank.c b/c/manojbank.c
similarity index 100%
rename from manojbank.c
rename to c/manojbank.c
diff --git a/minimum distance bw A and B (bfs) b/c/minimum distance bw A and B (bfs)
similarity index 100%
rename from minimum distance bw A and B (bfs)
rename to c/minimum distance bw A and B (bfs)
diff --git a/recordofdtuusingfile.c b/c/recordofdtuusingfile.c
similarity index 100%
rename from recordofdtuusingfile.c
rename to c/recordofdtuusingfile.c
diff --git a/stackoperationusingarray.c b/c/stackoperationusingarray.c
similarity index 100%
rename from stackoperationusingarray.c
rename to c/stackoperationusingarray.c
diff --git a/terraform-create-ec2.tf b/c/terraform-create-ec2.tf
similarity index 100%
rename from terraform-create-ec2.tf
rename to c/terraform-create-ec2.tf
diff --git a/time.c b/c/time.c
similarity index 100%
rename from time.c
rename to c/time.c
diff --git a/2stacks_in_array.cpp b/cpp/2stacks_in_array.cpp
similarity index 100%
rename from 2stacks_in_array.cpp
rename to cpp/2stacks_in_array.cpp
diff --git a/AVL.cpp b/cpp/AVL.cpp
similarity index 100%
rename from AVL.cpp
rename to cpp/AVL.cpp
diff --git a/Boruvka's_Algorithm_MSt.cpp b/cpp/Boruvka's_Algorithm_MSt.cpp
similarity index 100%
rename from Boruvka's_Algorithm_MSt.cpp
rename to cpp/Boruvka's_Algorithm_MSt.cpp
diff --git a/BucketSort.cpp b/cpp/BucketSort.cpp
similarity index 100%
rename from BucketSort.cpp
rename to cpp/BucketSort.cpp
diff --git a/CheckWhether.cpp b/cpp/CheckWhether.cpp
similarity index 100%
rename from CheckWhether.cpp
rename to cpp/CheckWhether.cpp
diff --git a/ChineseTheorem.cpp b/cpp/ChineseTheorem.cpp
similarity index 100%
rename from ChineseTheorem.cpp
rename to cpp/ChineseTheorem.cpp
diff --git a/Chinese_Remainder_Theorem.cpp b/cpp/Chinese_Remainder_Theorem.cpp
similarity index 100%
rename from Chinese_Remainder_Theorem.cpp
rename to cpp/Chinese_Remainder_Theorem.cpp
diff --git a/Constructor and destructor/Constructor and destructor.cpp b/cpp/Constructor and destructor/Constructor and destructor.cpp
similarity index 100%
rename from Constructor and destructor/Constructor and destructor.cpp
rename to cpp/Constructor and destructor/Constructor and destructor.cpp
diff --git a/Covid.cpp b/cpp/Covid.cpp
similarity index 100%
rename from Covid.cpp
rename to cpp/Covid.cpp
diff --git a/DSU_implementation.cpp b/cpp/DSU_implementation.cpp
similarity index 100%
rename from DSU_implementation.cpp
rename to cpp/DSU_implementation.cpp
diff --git a/EvenOddChecker.cpp b/cpp/EvenOddChecker.cpp
similarity index 100%
rename from EvenOddChecker.cpp
rename to cpp/EvenOddChecker.cpp
diff --git a/Expression_Evaluation.cpp b/cpp/Expression_Evaluation.cpp
similarity index 100%
rename from Expression_Evaluation.cpp
rename to cpp/Expression_Evaluation.cpp
diff --git a/Find Kth Largest Number STL.cpp b/cpp/Find Kth Largest Number STL.cpp
similarity index 100%
rename from Find Kth Largest Number STL.cpp
rename to cpp/Find Kth Largest Number STL.cpp
diff --git a/Hackerrank - Sorting - Intro to Tutorial Challenges.cpp b/cpp/Hackerrank - Sorting - Intro to Tutorial Challenges.cpp
similarity index 100%
rename from Hackerrank - Sorting - Intro to Tutorial Challenges.cpp
rename to cpp/Hackerrank - Sorting - Intro to Tutorial Challenges.cpp
diff --git a/Heap Sort.cpp b/cpp/Heap Sort.cpp
similarity index 100%
rename from Heap Sort.cpp
rename to cpp/Heap Sort.cpp
diff --git a/Heap-Sort.cpp b/cpp/Heap-Sort.cpp
similarity index 100%
rename from Heap-Sort.cpp
rename to cpp/Heap-Sort.cpp
diff --git a/Knapsack.cpp b/cpp/Knapsack.cpp
similarity index 100%
rename from Knapsack.cpp
rename to cpp/Knapsack.cpp
diff --git a/Largest_lexicographic_Array.cpp b/cpp/Largest_lexicographic_Array.cpp
similarity index 100%
rename from Largest_lexicographic_Array.cpp
rename to cpp/Largest_lexicographic_Array.cpp
diff --git a/Longest_increaing_subseqeunce.cpp b/cpp/Longest_increaing_subseqeunce.cpp
similarity index 100%
rename from Longest_increaing_subseqeunce.cpp
rename to cpp/Longest_increaing_subseqeunce.cpp
diff --git a/Merge Sorted Array.cpp b/cpp/Merge Sorted Array.cpp
similarity index 100%
rename from Merge Sorted Array.cpp
rename to cpp/Merge Sorted Array.cpp
diff --git a/Min_Stack.cpp b/cpp/Min_Stack.cpp
similarity index 100%
rename from Min_Stack.cpp
rename to cpp/Min_Stack.cpp
diff --git a/NQueenProblem.cpp b/cpp/NQueenProblem.cpp
similarity index 100%
rename from NQueenProblem.cpp
rename to cpp/NQueenProblem.cpp
diff --git a/PerfectionCalculator.cpp b/cpp/PerfectionCalculator.cpp
similarity index 100%
rename from PerfectionCalculator.cpp
rename to cpp/PerfectionCalculator.cpp
diff --git a/Prime Path (SPOJ) using bfs.cpp b/cpp/Prime Path (SPOJ) using bfs.cpp
similarity index 100%
rename from Prime Path (SPOJ) using bfs.cpp
rename to cpp/Prime Path (SPOJ) using bfs.cpp
diff --git a/Reverse_String.cpp b/cpp/Reverse_String.cpp
similarity index 100%
rename from Reverse_String.cpp
rename to cpp/Reverse_String.cpp
diff --git a/RivestShamirAdleman.cpp b/cpp/RivestShamirAdleman.cpp
similarity index 100%
rename from RivestShamirAdleman.cpp
rename to cpp/RivestShamirAdleman.cpp
diff --git a/RotateList.cpp b/cpp/RotateList.cpp
similarity index 100%
rename from RotateList.cpp
rename to cpp/RotateList.cpp
diff --git a/SCC.cpp b/cpp/SCC.cpp
similarity index 100%
rename from SCC.cpp
rename to cpp/SCC.cpp
diff --git a/SchedulingAlgo.cpp b/cpp/SchedulingAlgo.cpp
similarity index 100%
rename from SchedulingAlgo.cpp
rename to cpp/SchedulingAlgo.cpp
diff --git a/SelectionSort.cpp b/cpp/SelectionSort.cpp
similarity index 100%
rename from SelectionSort.cpp
rename to cpp/SelectionSort.cpp
diff --git a/SimpleSnakeGame.cpp b/cpp/SimpleSnakeGame.cpp
similarity index 100%
rename from SimpleSnakeGame.cpp
rename to cpp/SimpleSnakeGame.cpp
diff --git a/SinglyLinkedList.cpp b/cpp/SinglyLinkedList.cpp
similarity index 100%
rename from SinglyLinkedList.cpp
rename to cpp/SinglyLinkedList.cpp
diff --git a/Stack_LinkedList.cpp b/cpp/Stack_LinkedList.cpp
similarity index 100%
rename from Stack_LinkedList.cpp
rename to cpp/Stack_LinkedList.cpp
diff --git a/Subarray_with_a_sum.cpp b/cpp/Subarray_with_a_sum.cpp
similarity index 100%
rename from Subarray_with_a_sum.cpp
rename to cpp/Subarray_with_a_sum.cpp
diff --git a/SubsetSum.cpp b/cpp/SubsetSum.cpp
similarity index 100%
rename from SubsetSum.cpp
rename to cpp/SubsetSum.cpp
diff --git a/TimSort.cpp b/cpp/TimSort.cpp
similarity index 100%
rename from TimSort.cpp
rename to cpp/TimSort.cpp
diff --git a/TowerOfHanoi.cpp b/cpp/TowerOfHanoi.cpp
similarity index 100%
rename from TowerOfHanoi.cpp
rename to cpp/TowerOfHanoi.cpp
diff --git a/addTwoNums.cpp b/cpp/addTwoNums.cpp
similarity index 100%
rename from addTwoNums.cpp
rename to cpp/addTwoNums.cpp
diff --git a/agressiveCows.cpp b/cpp/agressiveCows.cpp
similarity index 100%
rename from agressiveCows.cpp
rename to cpp/agressiveCows.cpp
diff --git a/all_sub_sequence_string.cpp b/cpp/all_sub_sequence_string.cpp
similarity index 100%
rename from all_sub_sequence_string.cpp
rename to cpp/all_sub_sequence_string.cpp
diff --git a/arrQ.cpp b/cpp/arrQ.cpp
similarity index 100%
rename from arrQ.cpp
rename to cpp/arrQ.cpp
diff --git a/balancedparenthesis.cpp b/cpp/balancedparenthesis.cpp
similarity index 100%
rename from balancedparenthesis.cpp
rename to cpp/balancedparenthesis.cpp
diff --git a/bankers_algorithm_safe_state.cpp b/cpp/bankers_algorithm_safe_state.cpp
similarity index 100%
rename from bankers_algorithm_safe_state.cpp
rename to cpp/bankers_algorithm_safe_state.cpp
diff --git a/bfs.cpp b/cpp/bfs.cpp
similarity index 100%
rename from bfs.cpp
rename to cpp/bfs.cpp
diff --git a/binary exponent loop.cpp b/cpp/binary exponent loop.cpp
similarity index 100%
rename from binary exponent loop.cpp
rename to cpp/binary exponent loop.cpp
diff --git a/binary exponent recursive.cpp b/cpp/binary exponent recursive.cpp
similarity index 100%
rename from binary exponent recursive.cpp
rename to cpp/binary exponent recursive.cpp
diff --git a/binarySearch.cpp b/cpp/binarySearch.cpp
similarity index 100%
rename from binarySearch.cpp
rename to cpp/binarySearch.cpp
diff --git a/binarysearch.cpp b/cpp/binarysearch.cpp
similarity index 100%
rename from binarysearch.cpp
rename to cpp/binarysearch.cpp
diff --git a/bit.cpp b/cpp/bit.cpp
similarity index 100%
rename from bit.cpp
rename to cpp/bit.cpp
diff --git a/bit_set_or_not.cpp b/cpp/bit_set_or_not.cpp
similarity index 100%
rename from bit_set_or_not.cpp
rename to cpp/bit_set_or_not.cpp
diff --git a/chess_borad.cpp b/cpp/chess_borad.cpp
similarity index 100%
rename from chess_borad.cpp
rename to cpp/chess_borad.cpp
diff --git a/chineseRemainder.cpp b/cpp/chineseRemainder.cpp
similarity index 100%
rename from chineseRemainder.cpp
rename to cpp/chineseRemainder.cpp
diff --git a/coinTower.cpp b/cpp/coinTower.cpp
similarity index 100%
rename from coinTower.cpp
rename to cpp/coinTower.cpp
diff --git a/countSort.cpp b/cpp/countSort.cpp
similarity index 100%
rename from countSort.cpp
rename to cpp/countSort.cpp
diff --git a/cpp-addressof.cpp b/cpp/cpp-addressof.cpp
similarity index 100%
rename from cpp-addressof.cpp
rename to cpp/cpp-addressof.cpp
diff --git a/createaalinkedlist.cpp b/cpp/createaalinkedlist.cpp
similarity index 100%
rename from createaalinkedlist.cpp
rename to cpp/createaalinkedlist.cpp
diff --git a/createalinkedlist.cpp b/cpp/createalinkedlist.cpp
similarity index 100%
rename from createalinkedlist.cpp
rename to cpp/createalinkedlist.cpp
diff --git a/cycle_detect.cpp b/cpp/cycle_detect.cpp
similarity index 100%
rename from cycle_detect.cpp
rename to cpp/cycle_detect.cpp
diff --git a/defish_images.cpp b/cpp/defish_images.cpp
similarity index 100%
rename from defish_images.cpp
rename to cpp/defish_images.cpp
diff --git a/deleteNode.cpp b/cpp/deleteNode.cpp
similarity index 100%
rename from deleteNode.cpp
rename to cpp/deleteNode.cpp
diff --git a/divide-et-impera-sumofarray.cpp b/cpp/divide-et-impera-sumofarray.cpp
similarity index 100%
rename from divide-et-impera-sumofarray.cpp
rename to cpp/divide-et-impera-sumofarray.cpp
diff --git a/divide_and_conquer_minmax.cpp b/cpp/divide_and_conquer_minmax.cpp
similarity index 100%
rename from divide_and_conquer_minmax.cpp
rename to cpp/divide_and_conquer_minmax.cpp
diff --git a/djkshtra_algo.cpp b/cpp/djkshtra_algo.cpp
similarity index 100%
rename from djkshtra_algo.cpp
rename to cpp/djkshtra_algo.cpp
diff --git a/dutchflag.cpp b/cpp/dutchflag.cpp
similarity index 100%
rename from dutchflag.cpp
rename to cpp/dutchflag.cpp
diff --git a/et or pfi using seive way.cpp b/cpp/et or pfi using seive way.cpp
similarity index 100%
rename from et or pfi using seive way.cpp
rename to cpp/et or pfi using seive way.cpp
diff --git a/etf or phi in sqrt(n).cpp b/cpp/etf or phi in sqrt(n).cpp
similarity index 100%
rename from etf or phi in sqrt(n).cpp
rename to cpp/etf or phi in sqrt(n).cpp
diff --git a/euclid extended.cpp b/cpp/euclid extended.cpp
similarity index 100%
rename from euclid extended.cpp
rename to cpp/euclid extended.cpp
diff --git a/euclidproblem.cpp b/cpp/euclidproblem.cpp
similarity index 100%
rename from euclidproblem.cpp
rename to cpp/euclidproblem.cpp
diff --git a/externalsort-algo.cpp b/cpp/externalsort-algo.cpp
similarity index 100%
rename from externalsort-algo.cpp
rename to cpp/externalsort-algo.cpp
diff --git a/fibonacci_series.cpp b/cpp/fibonacci_series.cpp
similarity index 100%
rename from fibonacci_series.cpp
rename to cpp/fibonacci_series.cpp
diff --git a/gcd.cpp b/cpp/gcd.cpp
similarity index 100%
rename from gcd.cpp
rename to cpp/gcd.cpp
diff --git a/guessing game.cpp b/cpp/guessing game.cpp
similarity index 100%
rename from guessing game.cpp
rename to cpp/guessing game.cpp
diff --git a/implementaion.cpp b/cpp/implementaion.cpp
similarity index 100%
rename from implementaion.cpp
rename to cpp/implementaion.cpp
diff --git a/insertionSort.cpp b/cpp/insertionSort.cpp
similarity index 100%
rename from insertionSort.cpp
rename to cpp/insertionSort.cpp
diff --git a/insertion_sort.cpp b/cpp/insertion_sort.cpp
similarity index 100%
rename from insertion_sort.cpp
rename to cpp/insertion_sort.cpp
diff --git a/inversionCount.cpp b/cpp/inversionCount.cpp
similarity index 100%
rename from inversionCount.cpp
rename to cpp/inversionCount.cpp
diff --git a/keyPadCharactors.cpp b/cpp/keyPadCharactors.cpp
similarity index 100%
rename from keyPadCharactors.cpp
rename to cpp/keyPadCharactors.cpp
diff --git a/kmp_algo.cpp b/cpp/kmp_algo.cpp
similarity index 100%
rename from kmp_algo.cpp
rename to cpp/kmp_algo.cpp
diff --git a/knightsTour.cpp b/cpp/knightsTour.cpp
similarity index 100%
rename from knightsTour.cpp
rename to cpp/knightsTour.cpp
diff --git a/krusgal.cpp b/cpp/krusgal.cpp
similarity index 100%
rename from krusgal.cpp
rename to cpp/krusgal.cpp
diff --git a/leetcode 12.cpp b/cpp/leetcode 12.cpp
similarity index 100%
rename from leetcode 12.cpp
rename to cpp/leetcode 12.cpp
diff --git a/leetcode 123.cpp b/cpp/leetcode 123.cpp
similarity index 100%
rename from leetcode 123.cpp
rename to cpp/leetcode 123.cpp
diff --git a/leetcode 345.cpp b/cpp/leetcode 345.cpp
similarity index 100%
rename from leetcode 345.cpp
rename to cpp/leetcode 345.cpp
diff --git a/leetcode 456.cpp b/cpp/leetcode 456.cpp
similarity index 100%
rename from leetcode 456.cpp
rename to cpp/leetcode 456.cpp
diff --git a/leetcode 678.cpp b/cpp/leetcode 678.cpp
similarity index 100%
rename from leetcode 678.cpp
rename to cpp/leetcode 678.cpp
diff --git a/leetcode 901.cpp b/cpp/leetcode 901.cpp
similarity index 100%
rename from leetcode 901.cpp
rename to cpp/leetcode 901.cpp
diff --git a/letterCasePermutations.cpp b/cpp/letterCasePermutations.cpp
similarity index 100%
rename from letterCasePermutations.cpp
rename to cpp/letterCasePermutations.cpp
diff --git a/linearsearch.cpp b/cpp/linearsearch.cpp
similarity index 100%
rename from linearsearch.cpp
rename to cpp/linearsearch.cpp
diff --git a/ll.cpp b/cpp/ll.cpp
similarity index 100%
rename from ll.cpp
rename to cpp/ll.cpp
diff --git a/lnkdsort.cpp b/cpp/lnkdsort.cpp
similarity index 100%
rename from lnkdsort.cpp
rename to cpp/lnkdsort.cpp
diff --git a/longestPalindrome.cpp b/cpp/longestPalindrome.cpp
similarity index 100%
rename from longestPalindrome.cpp
rename to cpp/longestPalindrome.cpp
diff --git a/maxGCD.cpp b/cpp/maxGCD.cpp
similarity index 100%
rename from maxGCD.cpp
rename to cpp/maxGCD.cpp
diff --git a/mergesort-algo.cpp b/cpp/mergesort-algo.cpp
similarity index 100%
rename from mergesort-algo.cpp
rename to cpp/mergesort-algo.cpp
diff --git a/minmax.cpp b/cpp/minmax.cpp
similarity index 100%
rename from minmax.cpp
rename to cpp/minmax.cpp
diff --git a/modexp.cpp b/cpp/modexp.cpp
similarity index 100%
rename from modexp.cpp
rename to cpp/modexp.cpp
diff --git a/modular exponent loop.cpp b/cpp/modular exponent loop.cpp
similarity index 100%
rename from modular exponent loop.cpp
rename to cpp/modular exponent loop.cpp
diff --git a/modular exponent recursion.cpp b/cpp/modular exponent recursion.cpp
similarity index 100%
rename from modular exponent recursion.cpp
rename to cpp/modular exponent recursion.cpp
diff --git a/new.cpp b/cpp/new.cpp
similarity index 100%
rename from new.cpp
rename to cpp/new.cpp
diff --git a/no of div with seive.cpp b/cpp/no of div with seive.cpp
similarity index 100%
rename from no of div with seive.cpp
rename to cpp/no of div with seive.cpp
diff --git a/no of div without seive.cpp b/cpp/no of div without seive.cpp
similarity index 100%
rename from no of div without seive.cpp
rename to cpp/no of div without seive.cpp
diff --git a/palindromeORnot.cpp b/cpp/palindromeORnot.cpp
similarity index 100%
rename from palindromeORnot.cpp
rename to cpp/palindromeORnot.cpp
diff --git a/postfixevaluation.cpp b/cpp/postfixevaluation.cpp
similarity index 100%
rename from postfixevaluation.cpp
rename to cpp/postfixevaluation.cpp
diff --git a/prims_algo.cpp b/cpp/prims_algo.cpp
similarity index 100%
rename from prims_algo.cpp
rename to cpp/prims_algo.cpp
diff --git a/printallduplicates.cpp b/cpp/printallduplicates.cpp
similarity index 100%
rename from printallduplicates.cpp
rename to cpp/printallduplicates.cpp
diff --git a/questions.cpp b/cpp/questions.cpp
similarity index 100%
rename from questions.cpp
rename to cpp/questions.cpp
diff --git a/queues_implementation.cpp b/cpp/queues_implementation.cpp
similarity index 100%
rename from queues_implementation.cpp
rename to cpp/queues_implementation.cpp
diff --git a/queueusingstacks.cpp b/cpp/queueusingstacks.cpp
similarity index 100%
rename from queueusingstacks.cpp
rename to cpp/queueusingstacks.cpp
diff --git a/queueusingstacks2.cpp b/cpp/queueusingstacks2.cpp
similarity index 100%
rename from queueusingstacks2.cpp
rename to cpp/queueusingstacks2.cpp
diff --git a/quick_sort.cpp b/cpp/quick_sort.cpp
similarity index 100%
rename from quick_sort.cpp
rename to cpp/quick_sort.cpp
diff --git a/quicksort-algo.cpp b/cpp/quicksort-algo.cpp
similarity index 100%
rename from quicksort-algo.cpp
rename to cpp/quicksort-algo.cpp
diff --git a/radixsort-algo.cpp b/cpp/radixsort-algo.cpp
similarity index 100%
rename from radixsort-algo.cpp
rename to cpp/radixsort-algo.cpp
diff --git a/redundant.cpp b/cpp/redundant.cpp
similarity index 100%
rename from redundant.cpp
rename to cpp/redundant.cpp
diff --git a/regex-match.cpp b/cpp/regex-match.cpp
similarity index 100%
rename from regex-match.cpp
rename to cpp/regex-match.cpp
diff --git a/reversestring.cpp b/cpp/reversestring.cpp
similarity index 100%
rename from reversestring.cpp
rename to cpp/reversestring.cpp
diff --git a/searchInBST.cpp b/cpp/searchInBST.cpp
similarity index 100%
rename from searchInBST.cpp
rename to cpp/searchInBST.cpp
diff --git a/stoogesort.cpp b/cpp/stoogesort.cpp
similarity index 100%
rename from stoogesort.cpp
rename to cpp/stoogesort.cpp
diff --git a/stringsarerotation.cpp b/cpp/stringsarerotation.cpp
similarity index 100%
rename from stringsarerotation.cpp
rename to cpp/stringsarerotation.cpp
diff --git a/subtractTwoNums.cpp b/cpp/subtractTwoNums.cpp
similarity index 100%
rename from subtractTwoNums.cpp
rename to cpp/subtractTwoNums.cpp
diff --git a/sudokuSolver.cpp b/cpp/sudokuSolver.cpp
similarity index 100%
rename from sudokuSolver.cpp
rename to cpp/sudokuSolver.cpp
diff --git a/sum of all div using seive.cpp b/cpp/sum of all div using seive.cpp
similarity index 100%
rename from sum of all div using seive.cpp
rename to cpp/sum of all div using seive.cpp
diff --git a/sum of all prime using seive.cpp b/cpp/sum of all prime using seive.cpp
similarity index 100%
rename from sum of all prime using seive.cpp
rename to cpp/sum of all prime using seive.cpp
diff --git a/ternarySearch.cpp b/cpp/ternarySearch.cpp
similarity index 100%
rename from ternarySearch.cpp
rename to cpp/ternarySearch.cpp
diff --git a/topologicalSort.cpp b/cpp/topologicalSort.cpp
similarity index 100%
rename from topologicalSort.cpp
rename to cpp/topologicalSort.cpp
diff --git a/total_number_set_bit.cpp b/cpp/total_number_set_bit.cpp
similarity index 100%
rename from total_number_set_bit.cpp
rename to cpp/total_number_set_bit.cpp
diff --git a/transformation_in_2D_triangle.cpp b/cpp/transformation_in_2D_triangle.cpp
similarity index 100%
rename from transformation_in_2D_triangle.cpp
rename to cpp/transformation_in_2D_triangle.cpp
diff --git a/version.cpp b/cpp/version.cpp
similarity index 100%
rename from version.cpp
rename to cpp/version.cpp
diff --git a/insertion_sort.cs b/csharp/insertion_sort.cs
similarity index 100%
rename from insertion_sort.cs
rename to csharp/insertion_sort.cs
diff --git a/HashJoin.go b/go/HashJoin.go
similarity index 100%
rename from HashJoin.go
rename to go/HashJoin.go
diff --git a/HeapSort.go b/go/HeapSort.go
similarity index 100%
rename from HeapSort.go
rename to go/HeapSort.go
diff --git a/Automorphic Number b/html/Automorphic Number
similarity index 100%
rename from Automorphic Number
rename to html/Automorphic Number
diff --git a/JS-MOUSE-EVENT.HTML b/html/JS-MOUSE-EVENT.HTML
similarity index 100%
rename from JS-MOUSE-EVENT.HTML
rename to html/JS-MOUSE-EVENT.HTML
diff --git a/Studentform.html b/html/Studentform.html
similarity index 100%
rename from Studentform.html
rename to html/Studentform.html
diff --git a/client-side_validation b/html/client-side_validation
similarity index 100%
rename from client-side_validation
rename to html/client-side_validation
diff --git a/form.html b/html/form.html
similarity index 100%
rename from form.html
rename to html/form.html
diff --git a/index.html b/html/index.html
similarity index 100%
rename from index.html
rename to html/index.html
diff --git a/js-arraydata.html b/html/js-arraydata.html
similarity index 100%
rename from js-arraydata.html
rename to html/js-arraydata.html
diff --git a/js-evenodd.html b/html/js-evenodd.html
similarity index 100%
rename from js-evenodd.html
rename to html/js-evenodd.html
diff --git a/js-formvalidation.html b/html/js-formvalidation.html
similarity index 100%
rename from js-formvalidation.html
rename to html/js-formvalidation.html
diff --git a/js-read-h1.html b/html/js-read-h1.html
similarity index 100%
rename from js-read-h1.html
rename to html/js-read-h1.html
diff --git a/js-value-textbox.html b/html/js-value-textbox.html
similarity index 100%
rename from js-value-textbox.html
rename to html/js-value-textbox.html
diff --git a/paralax.html b/html/paralax.html
similarity index 100%
rename from paralax.html
rename to html/paralax.html
diff --git a/stats.html b/html/stats.html
similarity index 100%
rename from stats.html
rename to html/stats.html
diff --git a/Game Of Maximization(Hackerrank Hackfest 2020)/Question.pdf b/java/Game Of Maximization(Hackerrank Hackfest 2020)/Question.pdf
similarity index 100%
rename from Game Of Maximization(Hackerrank Hackfest 2020)/Question.pdf
rename to java/Game Of Maximization(Hackerrank Hackfest 2020)/Question.pdf
diff --git a/Game Of Maximization(Hackerrank Hackfest 2020)/Solution.java b/java/Game Of Maximization(Hackerrank Hackfest 2020)/Solution.java
similarity index 100%
rename from Game Of Maximization(Hackerrank Hackfest 2020)/Solution.java
rename to java/Game Of Maximization(Hackerrank Hackfest 2020)/Solution.java
diff --git a/Gt$Node.class b/java/Gt$Node.class
similarity index 100%
rename from Gt$Node.class
rename to java/Gt$Node.class
diff --git a/Gt.class b/java/Gt.class
similarity index 100%
rename from Gt.class
rename to java/Gt.class
diff --git a/Gt.java b/java/Gt.java
similarity index 100%
rename from Gt.java
rename to java/Gt.java
diff --git a/Island Perimeter b/java/Island Perimeter
similarity index 100%
rename from Island Perimeter
rename to java/Island Perimeter
diff --git a/Java_Leap_year/demo_2.java b/java/Java_Leap_year/demo_2.java
similarity index 100%
rename from Java_Leap_year/demo_2.java
rename to java/Java_Leap_year/demo_2.java
diff --git a/KaratsubaAlgo.java b/java/KaratsubaAlgo.java
similarity index 100%
rename from KaratsubaAlgo.java
rename to java/KaratsubaAlgo.java
diff --git a/KnapSack/KnapSackZeroOneRecursive.java b/java/KnapSack/KnapSackZeroOneRecursive.java
similarity index 100%
rename from KnapSack/KnapSackZeroOneRecursive.java
rename to java/KnapSack/KnapSackZeroOneRecursive.java
diff --git a/MeanMedian2.java b/java/MeanMedian2.java
similarity index 100%
rename from MeanMedian2.java
rename to java/MeanMedian2.java
diff --git a/Movie Recommender System/.idea/$PRODUCT_WORKSPACE_FILE$ b/java/Movie Recommender System/.idea/$PRODUCT_WORKSPACE_FILE$
similarity index 100%
rename from Movie Recommender System/.idea/$PRODUCT_WORKSPACE_FILE$
rename to java/Movie Recommender System/.idea/$PRODUCT_WORKSPACE_FILE$
diff --git a/Movie Recommender System/.idea/.gitignore b/java/Movie Recommender System/.idea/.gitignore
similarity index 100%
rename from Movie Recommender System/.idea/.gitignore
rename to java/Movie Recommender System/.idea/.gitignore
diff --git a/Movie Recommender System/.idea/misc.xml b/java/Movie Recommender System/.idea/misc.xml
similarity index 100%
rename from Movie Recommender System/.idea/misc.xml
rename to java/Movie Recommender System/.idea/misc.xml
diff --git a/Movie Recommender System/.idea/modules.xml b/java/Movie Recommender System/.idea/modules.xml
similarity index 100%
rename from Movie Recommender System/.idea/modules.xml
rename to java/Movie Recommender System/.idea/modules.xml
diff --git a/Movie Recommender System/.idea/vcs.xml b/java/Movie Recommender System/.idea/vcs.xml
similarity index 100%
rename from Movie Recommender System/.idea/vcs.xml
rename to java/Movie Recommender System/.idea/vcs.xml
diff --git a/Movie Recommender System/OOP Project.iml b/java/Movie Recommender System/OOP Project.iml
similarity index 100%
rename from Movie Recommender System/OOP Project.iml
rename to java/Movie Recommender System/OOP Project.iml
diff --git a/Movie Recommender System/README.md b/java/Movie Recommender System/README.md
similarity index 100%
rename from Movie Recommender System/README.md
rename to java/Movie Recommender System/README.md
diff --git a/Movie Recommender System/out/production/OOP Project/Check.class b/java/Movie Recommender System/out/production/OOP Project/Check.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/Check.class
rename to java/Movie Recommender System/out/production/OOP Project/Check.class
diff --git a/Movie Recommender System/out/production/OOP Project/Login.class b/java/Movie Recommender System/out/production/OOP Project/Login.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/Login.class
rename to java/Movie Recommender System/out/production/OOP Project/Login.class
diff --git a/Movie Recommender System/out/production/OOP Project/MovieList.class b/java/Movie Recommender System/out/production/OOP Project/MovieList.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/MovieList.class
rename to java/Movie Recommender System/out/production/OOP Project/MovieList.class
diff --git a/Movie Recommender System/out/production/OOP Project/MovieSuggester.class b/java/Movie Recommender System/out/production/OOP Project/MovieSuggester.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/MovieSuggester.class
rename to java/Movie Recommender System/out/production/OOP Project/MovieSuggester.class
diff --git a/Movie Recommender System/out/production/OOP Project/MyException.class b/java/Movie Recommender System/out/production/OOP Project/MyException.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/MyException.class
rename to java/Movie Recommender System/out/production/OOP Project/MyException.class
diff --git a/Movie Recommender System/out/production/OOP Project/SignUp.class b/java/Movie Recommender System/out/production/OOP Project/SignUp.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/SignUp.class
rename to java/Movie Recommender System/out/production/OOP Project/SignUp.class
diff --git a/Movie Recommender System/out/production/OOP Project/User.class b/java/Movie Recommender System/out/production/OOP Project/User.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/User.class
rename to java/Movie Recommender System/out/production/OOP Project/User.class
diff --git a/Movie Recommender System/out/production/OOP Project/WriteToFile.class b/java/Movie Recommender System/out/production/OOP Project/WriteToFile.class
similarity index 100%
rename from Movie Recommender System/out/production/OOP Project/WriteToFile.class
rename to java/Movie Recommender System/out/production/OOP Project/WriteToFile.class
diff --git a/Movie Recommender System/src/Check.java b/java/Movie Recommender System/src/Check.java
similarity index 100%
rename from Movie Recommender System/src/Check.java
rename to java/Movie Recommender System/src/Check.java
diff --git a/Movie Recommender System/src/EraserThread.java b/java/Movie Recommender System/src/EraserThread.java
similarity index 100%
rename from Movie Recommender System/src/EraserThread.java
rename to java/Movie Recommender System/src/EraserThread.java
diff --git a/Movie Recommender System/src/Login.java b/java/Movie Recommender System/src/Login.java
similarity index 100%
rename from Movie Recommender System/src/Login.java
rename to java/Movie Recommender System/src/Login.java
diff --git a/Movie Recommender System/src/MovieList.java b/java/Movie Recommender System/src/MovieList.java
similarity index 100%
rename from Movie Recommender System/src/MovieList.java
rename to java/Movie Recommender System/src/MovieList.java
diff --git a/Movie Recommender System/src/MovieSuggester.java b/java/Movie Recommender System/src/MovieSuggester.java
similarity index 100%
rename from Movie Recommender System/src/MovieSuggester.java
rename to java/Movie Recommender System/src/MovieSuggester.java
diff --git a/Movie Recommender System/src/MyException.java b/java/Movie Recommender System/src/MyException.java
similarity index 100%
rename from Movie Recommender System/src/MyException.java
rename to java/Movie Recommender System/src/MyException.java
diff --git a/Movie Recommender System/src/PasswordField.java b/java/Movie Recommender System/src/PasswordField.java
similarity index 100%
rename from Movie Recommender System/src/PasswordField.java
rename to java/Movie Recommender System/src/PasswordField.java
diff --git a/Movie Recommender System/src/SignUp.java b/java/Movie Recommender System/src/SignUp.java
similarity index 100%
rename from Movie Recommender System/src/SignUp.java
rename to java/Movie Recommender System/src/SignUp.java
diff --git a/Movie Recommender System/src/User.java b/java/Movie Recommender System/src/User.java
similarity index 100%
rename from Movie Recommender System/src/User.java
rename to java/Movie Recommender System/src/User.java
diff --git a/Movie Recommender System/src/WriteToFile.java b/java/Movie Recommender System/src/WriteToFile.java
similarity index 100%
rename from Movie Recommender System/src/WriteToFile.java
rename to java/Movie Recommender System/src/WriteToFile.java
diff --git a/PrimeCheck.java b/java/PrimeCheck.java
similarity index 100%
rename from PrimeCheck.java
rename to java/PrimeCheck.java
diff --git a/RandomGuess4.java b/java/RandomGuess4.java
similarity index 100%
rename from RandomGuess4.java
rename to java/RandomGuess4.java
diff --git a/StockBuySell.java b/java/StockBuySell.java
similarity index 100%
rename from StockBuySell.java
rename to java/StockBuySell.java
diff --git a/StringSort.java b/java/StringSort.java
similarity index 100%
rename from StringSort.java
rename to java/StringSort.java
diff --git a/Two Dimensional Array.java b/java/Two Dimensional Array.java
similarity index 100%
rename from Two Dimensional Array.java
rename to java/Two Dimensional Array.java
diff --git a/hotel-management-system.java b/java/hotel-management-system.java
similarity index 100%
rename from hotel-management-system.java
rename to java/hotel-management-system.java
diff --git a/leetcode 789.java b/java/leetcode 789.java
similarity index 100%
rename from leetcode 789.java
rename to java/leetcode 789.java
diff --git a/merge_sort.java b/java/merge_sort.java
similarity index 100%
rename from merge_sort.java
rename to java/merge_sort.java
diff --git a/optimizedprime.java b/java/optimizedprime.java
similarity index 100%
rename from optimizedprime.java
rename to java/optimizedprime.java
diff --git a/All FCC javascript and datastructures challenge solutions/caesars-cipher.txt b/js/All FCC javascript and datastructures challenge solutions/caesars-cipher.txt
similarity index 100%
rename from All FCC javascript and datastructures challenge solutions/caesars-cipher.txt
rename to js/All FCC javascript and datastructures challenge solutions/caesars-cipher.txt
diff --git a/All FCC javascript and datastructures challenge solutions/cash-register.txt b/js/All FCC javascript and datastructures challenge solutions/cash-register.txt
similarity index 100%
rename from All FCC javascript and datastructures challenge solutions/cash-register.txt
rename to js/All FCC javascript and datastructures challenge solutions/cash-register.txt
diff --git a/All FCC javascript and datastructures challenge solutions/palindrome-checker.txt b/js/All FCC javascript and datastructures challenge solutions/palindrome-checker.txt
similarity index 100%
rename from All FCC javascript and datastructures challenge solutions/palindrome-checker.txt
rename to js/All FCC javascript and datastructures challenge solutions/palindrome-checker.txt
diff --git a/All FCC javascript and datastructures challenge solutions/roman-numeral-converter.txt b/js/All FCC javascript and datastructures challenge solutions/roman-numeral-converter.txt
similarity index 100%
rename from All FCC javascript and datastructures challenge solutions/roman-numeral-converter.txt
rename to js/All FCC javascript and datastructures challenge solutions/roman-numeral-converter.txt
diff --git a/All FCC javascript and datastructures challenge solutions/telephone-number-validator.txt b/js/All FCC javascript and datastructures challenge solutions/telephone-number-validator.txt
similarity index 100%
rename from All FCC javascript and datastructures challenge solutions/telephone-number-validator.txt
rename to js/All FCC javascript and datastructures challenge solutions/telephone-number-validator.txt
diff --git a/Bubble sort b/js/Bubble sort
similarity index 100%
rename from Bubble sort
rename to js/Bubble sort
diff --git a/HelloWorld.js b/js/HelloWorld.js
similarity index 100%
rename from HelloWorld.js
rename to js/HelloWorld.js
diff --git a/alpha_sort.js b/js/alpha_sort.js
similarity index 100%
rename from alpha_sort.js
rename to js/alpha_sort.js
diff --git a/binary_search.js b/js/binary_search.js
similarity index 100%
rename from binary_search.js
rename to js/binary_search.js
diff --git a/bracketNotation.js b/js/bracketNotation.js
similarity index 100%
rename from bracketNotation.js
rename to js/bracketNotation.js
diff --git a/factorial.js b/js/factorial.js
similarity index 100%
rename from factorial.js
rename to js/factorial.js
diff --git a/fibonacci.js b/js/fibonacci.js
similarity index 100%
rename from fibonacci.js
rename to js/fibonacci.js
diff --git a/given_sum.js b/js/given_sum.js
similarity index 100%
rename from given_sum.js
rename to js/given_sum.js
diff --git a/golfArray.js b/js/golfArray.js
similarity index 100%
rename from golfArray.js
rename to js/golfArray.js
diff --git a/isArray.js b/js/isArray.js
similarity index 100%
rename from isArray.js
rename to js/isArray.js
diff --git a/leetcode 43.js b/js/leetcode 43.js
similarity index 100%
rename from leetcode 43.js
rename to js/leetcode 43.js
diff --git a/lengthOfAString.js b/js/lengthOfAString.js
similarity index 100%
rename from lengthOfAString.js
rename to js/lengthOfAString.js
diff --git a/mergesort.js b/js/mergesort.js
similarity index 100%
rename from mergesort.js
rename to js/mergesort.js
diff --git a/minimum-swapper-2.js b/js/minimum-swapper-2.js
similarity index 100%
rename from minimum-swapper-2.js
rename to js/minimum-swapper-2.js
diff --git a/node-rectangle.js b/js/node-rectangle.js
similarity index 100%
rename from node-rectangle.js
rename to js/node-rectangle.js
diff --git a/order_by_index.js b/js/order_by_index.js
similarity index 100%
rename from order_by_index.js
rename to js/order_by_index.js
diff --git a/prime_number.js b/js/prime_number.js
similarity index 100%
rename from prime_number.js
rename to js/prime_number.js
diff --git a/quick_sort.js b/js/quick_sort.js
similarity index 100%
rename from quick_sort.js
rename to js/quick_sort.js
diff --git a/reverseAString.js b/js/reverseAString.js
similarity index 100%
rename from reverseAString.js
rename to js/reverseAString.js
diff --git a/reverse_str.js b/js/reverse_str.js
similarity index 100%
rename from reverse_str.js
rename to js/reverse_str.js
diff --git a/romanize.js b/js/romanize.js
similarity index 100%
rename from romanize.js
rename to js/romanize.js
diff --git a/rotate-array-from-left.js b/js/rotate-array-from-left.js
similarity index 100%
rename from rotate-array-from-left.js
rename to js/rotate-array-from-left.js
diff --git a/selecting WithSwitchStmts.js b/js/selecting WithSwitchStmts.js
similarity index 100%
rename from selecting WithSwitchStmts.js
rename to js/selecting WithSwitchStmts.js
diff --git a/selection-sort.js b/js/selection-sort.js
similarity index 100%
rename from selection-sort.js
rename to js/selection-sort.js
diff --git a/Helloworld.php b/php/Helloworld.php
similarity index 100%
rename from Helloworld.php
rename to php/Helloworld.php
diff --git a/core.php b/php/core.php
similarity index 100%
rename from core.php
rename to php/core.php
diff --git a/AVL_tree_Deletion.py b/python/AVL_tree_Deletion.py
similarity index 100%
rename from AVL_tree_Deletion.py
rename to python/AVL_tree_Deletion.py
diff --git a/AVL_tree_Insertion.py b/python/AVL_tree_Insertion.py
similarity index 100%
rename from AVL_tree_Insertion.py
rename to python/AVL_tree_Insertion.py
diff --git a/BST.py b/python/BST.py
similarity index 100%
rename from BST.py
rename to python/BST.py
diff --git a/Binarysearch.py b/python/Binarysearch.py
similarity index 100%
rename from Binarysearch.py
rename to python/Binarysearch.py
diff --git a/BitonicSort.py b/python/BitonicSort.py
similarity index 100%
rename from BitonicSort.py
rename to python/BitonicSort.py
diff --git a/Catalan_Number_python.py b/python/Catalan_Number_python.py
similarity index 100%
rename from Catalan_Number_python.py
rename to python/Catalan_Number_python.py
diff --git a/CountPrimesUsingSieve.py b/python/CountPrimesUsingSieve.py
similarity index 100%
rename from CountPrimesUsingSieve.py
rename to python/CountPrimesUsingSieve.py
diff --git a/CyclicSort.py b/python/CyclicSort.py
similarity index 100%
rename from CyclicSort.py
rename to python/CyclicSort.py
diff --git a/Fisher_Yates.py b/python/Fisher_Yates.py
similarity index 100%
rename from Fisher_Yates.py
rename to python/Fisher_Yates.py
diff --git a/GUI_AgeCalculator.py b/python/GUI_AgeCalculator.py
similarity index 100%
rename from GUI_AgeCalculator.py
rename to python/GUI_AgeCalculator.py
diff --git a/Guessing_Number.py b/python/Guessing_Number.py
similarity index 100%
rename from Guessing_Number.py
rename to python/Guessing_Number.py
diff --git a/Inorder_Successor_BinaryTree.py b/python/Inorder_Successor_BinaryTree.py
similarity index 100%
rename from Inorder_Successor_BinaryTree.py
rename to python/Inorder_Successor_BinaryTree.py
diff --git a/JPGtoPNG_Converter.py b/python/JPGtoPNG_Converter.py
similarity index 100%
rename from JPGtoPNG_Converter.py
rename to python/JPGtoPNG_Converter.py
diff --git a/KadaneAlgorithm.py b/python/KadaneAlgorithm.py
similarity index 100%
rename from KadaneAlgorithm.py
rename to python/KadaneAlgorithm.py
diff --git a/Larry's-Array.py b/python/Larry's-Array.py
similarity index 100%
rename from Larry's-Array.py
rename to python/Larry's-Array.py
diff --git a/Level_Order_Traversal(BFS).py b/python/Level_Order_Traversal(BFS).py
similarity index 100%
rename from Level_Order_Traversal(BFS).py
rename to python/Level_Order_Traversal(BFS).py
diff --git a/Linear_search.py b/python/Linear_search.py
similarity index 100%
rename from Linear_search.py
rename to python/Linear_search.py
diff --git a/List.ipynb b/python/List.ipynb
similarity index 100%
rename from List.ipynb
rename to python/List.ipynb
diff --git a/MNIST Classification using Stacked Autoencoder.ipynb b/python/MNIST Classification using Stacked Autoencoder.ipynb
similarity index 100%
rename from MNIST Classification using Stacked Autoencoder.ipynb
rename to python/MNIST Classification using Stacked Autoencoder.ipynb
diff --git a/MSP.py b/python/MSP.py
similarity index 100%
rename from MSP.py
rename to python/MSP.py
diff --git a/Max_Subarray.py b/python/Max_Subarray.py
similarity index 100%
rename from Max_Subarray.py
rename to python/Max_Subarray.py
diff --git a/MergeSortPythonCCSC.py b/python/MergeSortPythonCCSC.py
similarity index 100%
rename from MergeSortPythonCCSC.py
rename to python/MergeSortPythonCCSC.py
diff --git a/PathSum.py b/python/PathSum.py
similarity index 100%
rename from PathSum.py
rename to python/PathSum.py
diff --git a/Peak_array.py b/python/Peak_array.py
similarity index 100%
rename from Peak_array.py
rename to python/Peak_array.py
diff --git a/QueenAttack.py b/python/QueenAttack.py
similarity index 100%
rename from QueenAttack.py
rename to python/QueenAttack.py
diff --git a/QuickSort.py b/python/QuickSort.py
similarity index 100%
rename from QuickSort.py
rename to python/QuickSort.py
diff --git a/SelectionSort.py b/python/SelectionSort.py
similarity index 100%
rename from SelectionSort.py
rename to python/SelectionSort.py
diff --git a/Siteblocker.py b/python/Siteblocker.py
similarity index 100%
rename from Siteblocker.py
rename to python/Siteblocker.py
diff --git a/Stack.py b/python/Stack.py
similarity index 100%
rename from Stack.py
rename to python/Stack.py
diff --git a/StonePaperScissors.py b/python/StonePaperScissors.py
similarity index 100%
rename from StonePaperScissors.py
rename to python/StonePaperScissors.py
diff --git a/TowerOfHanoi.py b/python/TowerOfHanoi.py
similarity index 100%
rename from TowerOfHanoi.py
rename to python/TowerOfHanoi.py
diff --git a/python/XGBoost.ipynb b/python/XGBoost.ipynb
new file mode 100644
index 0000000..fb51ab7
--- /dev/null
+++ b/python/XGBoost.ipynb
@@ -0,0 +1,4247 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "id": "fd0d7a63",
+ "metadata": {},
+ "source": [
+ "Bank marketing dateset taken from UCI \n",
+ "Link : https://archive.ics.uci.edu/dataset/222/bank+marketing \n"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "4d9b2d88",
+ "metadata": {},
+ "source": [
+ "The data is related with direct marketing campaigns of a Portuguese banking institution. The marketing campaigns were based on phone calls. Often, more than one contact to the same client was required, in order to access if the product (bank term deposit) would be ('yes') or not ('no') subscribed. \n",
+ "The classification goal is to predict if the client will subscribe (yes/no) a term deposit (variable y).\n",
+ "\n"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "id": "643147f7",
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 1,
+ "id": "4e9098ea",
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "import pandas as pd\n",
+ "from sklearn.model_selection import train_test_split\n",
+ "from xgboost import XGBClassifier\n",
+ "from sklearn.pipeline import Pipeline\n",
+ "from category_encoders.target_encoder import TargetEncoder\n",
+ "from skopt import BayesSearchCV\n",
+ "from skopt.space import Real, Categorical, Integer\n"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 2,
+ "id": "5368de6c",
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "#loading dataset\n",
+ "df = pd.read_csv('bank-additional-full.csv', delimiter=';')\n",
+ "#dropping columns that might be less related to desired output\n",
+ "drop_columns = [ 'duration','emp.var.rate', 'cons.price.idx', 'cons.conf.idx', 'euribor3m', 'nr.employed']\n",
+ "#rename columns for better understanding\n",
+ "df = df.rename(columns={'job': 'job_type', 'default': 'default_status',\n",
+ " 'housing': 'housing_loan_status', 'loan': 'personal_loan_status',\n",
+ " 'contact': 'contact_type', 'month': 'contact_month',\n",
+ " 'day_of_week': 'contact_day_of_week', 'campaign': 'num_contacts',\n",
+ " 'pdays': 'days_last_contact', 'previous': 'previous_contacts',\n",
+ " 'poutcome': 'previous_outcome',\n",
+ " 'y': 'result'\n",
+ " })\n",
+ "# Drop the specified columns\n",
+ "df = df.drop(columns=drop_columns, errors='ignore')\n",
+ "#convert target to numerical values\n",
+ "#specify the column and map its distinct values to numerical values\n",
+ "df['result'] = df['result'].map({'yes':1, 'no':0})"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "0616b74b",
+ "metadata": {},
+ "source": [
+ "Lets look at the dataset now"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 3,
+ "id": "98d0c69e",
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/html": [
+ "
In a Jupyter environment, please rerun this cell to show the HTML representation or trust the notebook. On GitHub, the HTML representation is unable to render, please try loading this page with nbviewer.org.
\n",
+ "
\n",
+ " \n",
+ " Parameters\n",
+ "
\n",
+ " \n",
+ " \n",
+ "
\n",
+ "
\n",
+ "
steps
\n",
+ "
[('encoder', ...), ('clf', ...)]
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
transform_input
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
memory
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
verbose
\n",
+ "
False
\n",
+ "
\n",
+ " \n",
+ " \n",
+ "
\n",
+ " \n",
+ "
\n",
+ "
\n",
+ "
\n",
+ " \n",
+ " Parameters\n",
+ "
\n",
+ " \n",
+ " \n",
+ "
\n",
+ "
\n",
+ "
verbose
\n",
+ "
0
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
cols
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
drop_invariant
\n",
+ "
False
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
return_df
\n",
+ "
True
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
handle_missing
\n",
+ "
'value'
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
handle_unknown
\n",
+ "
'value'
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
min_samples_leaf
\n",
+ "
20
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
smoothing
\n",
+ "
10
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
hierarchy
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ " \n",
+ "
\n",
+ " \n",
+ "
\n",
+ "
\n",
+ "
\n",
+ " \n",
+ " Parameters\n",
+ "
\n",
+ " \n",
+ " \n",
+ "
\n",
+ "
\n",
+ "
objective
\n",
+ "
'binary:logistic'
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
base_score
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
booster
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
callbacks
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
colsample_bylevel
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
colsample_bynode
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
colsample_bytree
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
device
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
early_stopping_rounds
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
enable_categorical
\n",
+ "
False
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
eval_metric
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
feature_types
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
feature_weights
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
gamma
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
grow_policy
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
importance_type
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
interaction_constraints
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
learning_rate
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
max_bin
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
max_cat_threshold
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
max_cat_to_onehot
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
max_delta_step
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
max_depth
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
max_leaves
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
min_child_weight
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
missing
\n",
+ "
nan
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
monotone_constraints
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
multi_strategy
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
n_estimators
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
n_jobs
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
num_parallel_tree
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
random_state
\n",
+ "
8
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
reg_alpha
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
reg_lambda
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
sampling_method
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
scale_pos_weight
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
subsample
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
tree_method
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
validate_parameters
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ "\n",
+ "
\n",
+ "
\n",
+ "
verbosity
\n",
+ "
None
\n",
+ "
\n",
+ " \n",
+ " \n",
+ "
\n",
+ " \n",
+ "
\n",
+ "
"
+ ],
+ "text/plain": [
+ "Pipeline(steps=[('encoder', TargetEncoder()),\n",
+ " ('clf',\n",
+ " XGBClassifier(base_score=None, booster=None, callbacks=None,\n",
+ " colsample_bylevel=None, colsample_bynode=None,\n",
+ " colsample_bytree=None, device=None,\n",
+ " early_stopping_rounds=None,\n",
+ " enable_categorical=False, eval_metric=None,\n",
+ " feature_types=None, feature_weights=None,\n",
+ " gamma=None, grow_policy=None,\n",
+ " importance_type=None,\n",
+ " interaction_constraints=None, learning_rate=None,\n",
+ " max_bin=None, max_cat_threshold=None,\n",
+ " max_cat_to_onehot=None, max_delta_step=None,\n",
+ " max_depth=None, max_leaves=None,\n",
+ " min_child_weight=None, missing=nan,\n",
+ " monotone_constraints=None, multi_strategy=None,\n",
+ " n_estimators=None, n_jobs=None,\n",
+ " num_parallel_tree=None, ...))])"
+ ]
+ },
+ "execution_count": 7,
+ "metadata": {},
+ "output_type": "execute_result"
+ }
+ ],
+ "source": [
+ "estimators = [\n",
+ " ('encoder', TargetEncoder()),\n",
+ " ('clf', XGBClassifier(random_state=8)) # can customize objective function with the objective parameter\n",
+ "]\n",
+ "pipe = Pipeline(steps=estimators)\n",
+ "pipe"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "5697f92a",
+ "metadata": {},
+ "source": [
+ "Hyper Parameter Tuning"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 8,
+ "id": "ae23227a",
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "search_space = {#within the estimator calling the parameters, Clf is the name of the classifier \n",
+ "# previously defined in the pipeline\n",
+ " 'clf__max_depth': Integer(2,8),\n",
+ " 'clf__learning_rate': Real(0.001, 1.0, prior='log-uniform'),\n",
+ " 'clf__subsample': Real(0.5, 1.0),\n",
+ " 'clf__colsample_bytree': Real(0.5, 1.0),\n",
+ " 'clf__colsample_bylevel': Real(0.5, 1.0),\n",
+ " 'clf__colsample_bynode' : Real(0.5, 1.0),\n",
+ " 'clf__reg_alpha': Real(0.0, 10.0),\n",
+ " 'clf__reg_lambda': Real(0.0, 10.0),\n",
+ " 'clf__gamma': Real(0.0, 10.0)\n",
+ "}\n",
+ "#Note: The search space can be customized based on the specific needs of the model and the dataset.\n",
+ "#BayesSearchCV is used for hyperparameter tuning using Bayesian optimization\n",
+ "#It allows for efficient exploration of the hyperparameter space.\n",
+ "#bayes_search requirese pipeline and search space to be defined\n",
+ "opt = BayesSearchCV(\n",
+ " estimator=pipe,\n",
+ " search_spaces=search_space,\n",
+ " n_iter=30,\n",
+ " scoring='roc_auc', \n",
+ " cv=3,\n",
+ " n_jobs=-1,\n",
+ " random_state=8,\n",
+ " verbose=2,\n",
+ " return_train_score=True,\n",
+ " #is_classifier=True\n",
+ ")\n"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "id": "351702bb",
+ "metadata": {},
+ "source": [
+ "Train the XGBoost model"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 9,
+ "id": "026d07ad",
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5331080642783614, clf__colsample_bynode=0.7262320733948379, clf__colsample_bytree=0.5362052518135637, clf__gamma=7.436578137661654, clf__learning_rate=0.0011002938624638172, clf__max_depth=5, clf__reg_alpha=5.016505750780453, clf__reg_lambda=1.964788283871643, clf__subsample=0.5258638996089925; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5331080642783614, clf__colsample_bynode=0.7262320733948379, clf__colsample_bytree=0.5362052518135637, clf__gamma=7.436578137661654, clf__learning_rate=0.0011002938624638172, clf__max_depth=5, clf__reg_alpha=5.016505750780453, clf__reg_lambda=1.964788283871643, clf__subsample=0.5258638996089925; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5331080642783614, clf__colsample_bynode=0.7262320733948379, clf__colsample_bytree=0.5362052518135637, clf__gamma=7.436578137661654, clf__learning_rate=0.0011002938624638172, clf__max_depth=5, clf__reg_alpha=5.016505750780453, clf__reg_lambda=1.964788283871643, clf__subsample=0.5258638996089925; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.7098720980049984, clf__colsample_bynode=0.5395172405909037, clf__colsample_bytree=0.5048675793234745, clf__gamma=3.4426412862156925, clf__learning_rate=0.002566198468819385, clf__max_depth=4, clf__reg_alpha=6.94019423320267, clf__reg_lambda=1.9029714271812788, clf__subsample=0.8480768493236798; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.7098720980049984, clf__colsample_bynode=0.5395172405909037, clf__colsample_bytree=0.5048675793234745, clf__gamma=3.4426412862156925, clf__learning_rate=0.002566198468819385, clf__max_depth=4, clf__reg_alpha=6.94019423320267, clf__reg_lambda=1.9029714271812788, clf__subsample=0.8480768493236798; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.7098720980049984, clf__colsample_bynode=0.5395172405909037, clf__colsample_bytree=0.5048675793234745, clf__gamma=3.4426412862156925, clf__learning_rate=0.002566198468819385, clf__max_depth=4, clf__reg_alpha=6.94019423320267, clf__reg_lambda=1.9029714271812788, clf__subsample=0.8480768493236798; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.6301181140809947, clf__colsample_bynode=0.7703817113387359, clf__colsample_bytree=0.506103014140404, clf__gamma=2.079165271399323, clf__learning_rate=0.0031574039841631043, clf__max_depth=3, clf__reg_alpha=3.9908788581451304, clf__reg_lambda=4.068904354579378, clf__subsample=0.691339226818626; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.6301181140809947, clf__colsample_bynode=0.7703817113387359, clf__colsample_bytree=0.506103014140404, clf__gamma=2.079165271399323, clf__learning_rate=0.0031574039841631043, clf__max_depth=3, clf__reg_alpha=3.9908788581451304, clf__reg_lambda=4.068904354579378, clf__subsample=0.691339226818626; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.6301181140809947, clf__colsample_bynode=0.7703817113387359, clf__colsample_bytree=0.506103014140404, clf__gamma=2.079165271399323, clf__learning_rate=0.0031574039841631043, clf__max_depth=3, clf__reg_alpha=3.9908788581451304, clf__reg_lambda=4.068904354579378, clf__subsample=0.691339226818626; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.7750018497221565, clf__colsample_bynode=0.5614437441596264, clf__colsample_bytree=0.9126202065825759, clf__gamma=8.289497472648083, clf__learning_rate=0.4299244814327041, clf__max_depth=6, clf__reg_alpha=2.784887532399771, clf__reg_lambda=1.67027558902639, clf__subsample=0.5966102807384807; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.7750018497221565, clf__colsample_bynode=0.5614437441596264, clf__colsample_bytree=0.9126202065825759, clf__gamma=8.289497472648083, clf__learning_rate=0.4299244814327041, clf__max_depth=6, clf__reg_alpha=2.784887532399771, clf__reg_lambda=1.67027558902639, clf__subsample=0.5966102807384807; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.7750018497221565, clf__colsample_bynode=0.5614437441596264, clf__colsample_bytree=0.9126202065825759, clf__gamma=8.289497472648083, clf__learning_rate=0.4299244814327041, clf__max_depth=6, clf__reg_alpha=2.784887532399771, clf__reg_lambda=1.67027558902639, clf__subsample=0.5966102807384807; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.9425384185492701, clf__colsample_bynode=0.9095956806239844, clf__colsample_bytree=0.706128679361455, clf__gamma=1.6598135411398998, clf__learning_rate=0.7929828265552742, clf__max_depth=7, clf__reg_alpha=6.127334959237263, clf__reg_lambda=4.20954286031855, clf__subsample=0.9992625073567596; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.9425384185492701, clf__colsample_bynode=0.9095956806239844, clf__colsample_bytree=0.706128679361455, clf__gamma=1.6598135411398998, clf__learning_rate=0.7929828265552742, clf__max_depth=7, clf__reg_alpha=6.127334959237263, clf__reg_lambda=4.20954286031855, clf__subsample=0.9992625073567596; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.9425384185492701, clf__colsample_bynode=0.9095956806239844, clf__colsample_bytree=0.706128679361455, clf__gamma=1.6598135411398998, clf__learning_rate=0.7929828265552742, clf__max_depth=7, clf__reg_alpha=6.127334959237263, clf__reg_lambda=4.20954286031855, clf__subsample=0.9992625073567596; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5056087634867006, clf__colsample_bynode=0.6000722403604478, clf__colsample_bytree=0.7220415864598968, clf__gamma=5.107918246929528, clf__learning_rate=0.00770902165228149, clf__max_depth=3, clf__reg_alpha=7.419482800525566, clf__reg_lambda=5.853383854066662, clf__subsample=0.9585647835362849; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.5056087634867006, clf__colsample_bynode=0.6000722403604478, clf__colsample_bytree=0.7220415864598968, clf__gamma=5.107918246929528, clf__learning_rate=0.00770902165228149, clf__max_depth=3, clf__reg_alpha=7.419482800525566, clf__reg_lambda=5.853383854066662, clf__subsample=0.9585647835362849; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.5056087634867006, clf__colsample_bynode=0.6000722403604478, clf__colsample_bytree=0.7220415864598968, clf__gamma=5.107918246929528, clf__learning_rate=0.00770902165228149, clf__max_depth=3, clf__reg_alpha=7.419482800525566, clf__reg_lambda=5.853383854066662, clf__subsample=0.9585647835362849; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.935225370284509, clf__colsample_bynode=0.5390519575908672, clf__colsample_bytree=0.6298025462003691, clf__gamma=8.638048955941981, clf__learning_rate=0.014685268484248162, clf__max_depth=6, clf__reg_alpha=9.596594920803778, clf__reg_lambda=1.7891228625458846, clf__subsample=0.6457705718332348; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.935225370284509, clf__colsample_bynode=0.5390519575908672, clf__colsample_bytree=0.6298025462003691, clf__gamma=8.638048955941981, clf__learning_rate=0.014685268484248162, clf__max_depth=6, clf__reg_alpha=9.596594920803778, clf__reg_lambda=1.7891228625458846, clf__subsample=0.6457705718332348; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.935225370284509, clf__colsample_bynode=0.5390519575908672, clf__colsample_bytree=0.6298025462003691, clf__gamma=8.638048955941981, clf__learning_rate=0.014685268484248162, clf__max_depth=6, clf__reg_alpha=9.596594920803778, clf__reg_lambda=1.7891228625458846, clf__subsample=0.6457705718332348; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.8255063664935096, clf__colsample_bynode=0.9566459979367115, clf__colsample_bytree=0.7745652753956729, clf__gamma=9.034580483401264, clf__learning_rate=0.02796171154881776, clf__max_depth=2, clf__reg_alpha=2.3562893513108114, clf__reg_lambda=7.616125300822734, clf__subsample=0.5252342481879482; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.8255063664935096, clf__colsample_bynode=0.9566459979367115, clf__colsample_bytree=0.7745652753956729, clf__gamma=9.034580483401264, clf__learning_rate=0.02796171154881776, clf__max_depth=2, clf__reg_alpha=2.3562893513108114, clf__reg_lambda=7.616125300822734, clf__subsample=0.5252342481879482; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.8255063664935096, clf__colsample_bynode=0.9566459979367115, clf__colsample_bytree=0.7745652753956729, clf__gamma=9.034580483401264, clf__learning_rate=0.02796171154881776, clf__max_depth=2, clf__reg_alpha=2.3562893513108114, clf__reg_lambda=7.616125300822734, clf__subsample=0.5252342481879482; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.7160044460033754, clf__colsample_bynode=0.5634842539270097, clf__colsample_bytree=0.8894150401192538, clf__gamma=0.12840880628708476, clf__learning_rate=0.006917774244564682, clf__max_depth=4, clf__reg_alpha=9.964867597661469, clf__reg_lambda=9.039217490191113, clf__subsample=0.7399361526500796; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.7160044460033754, clf__colsample_bynode=0.5634842539270097, clf__colsample_bytree=0.8894150401192538, clf__gamma=0.12840880628708476, clf__learning_rate=0.006917774244564682, clf__max_depth=4, clf__reg_alpha=9.964867597661469, clf__reg_lambda=9.039217490191113, clf__subsample=0.7399361526500796; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.7160044460033754, clf__colsample_bynode=0.5634842539270097, clf__colsample_bytree=0.8894150401192538, clf__gamma=0.12840880628708476, clf__learning_rate=0.006917774244564682, clf__max_depth=4, clf__reg_alpha=9.964867597661469, clf__reg_lambda=9.039217490191113, clf__subsample=0.7399361526500796; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.6854728136721551, clf__colsample_bynode=0.9716292421559054, clf__colsample_bytree=0.9999681720272138, clf__gamma=9.269342703724346, clf__learning_rate=0.4165635668761467, clf__max_depth=5, clf__reg_alpha=9.90967391483027, clf__reg_lambda=9.617478139041276, clf__subsample=0.7406323564767542; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.6854728136721551, clf__colsample_bynode=0.9716292421559054, clf__colsample_bytree=0.9999681720272138, clf__gamma=9.269342703724346, clf__learning_rate=0.4165635668761467, clf__max_depth=5, clf__reg_alpha=9.90967391483027, clf__reg_lambda=9.617478139041276, clf__subsample=0.7406323564767542; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.6854728136721551, clf__colsample_bynode=0.9716292421559054, clf__colsample_bytree=0.9999681720272138, clf__gamma=9.269342703724346, clf__learning_rate=0.4165635668761467, clf__max_depth=5, clf__reg_alpha=9.90967391483027, clf__reg_lambda=9.617478139041276, clf__subsample=0.7406323564767542; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.7723018676832343, clf__colsample_bynode=0.7730488247401104, clf__colsample_bytree=0.912288322775457, clf__gamma=0.09283704456179322, clf__learning_rate=0.22456104337268815, clf__max_depth=3, clf__reg_alpha=0.13080555109971195, clf__reg_lambda=3.0680973538012397, clf__subsample=0.9696264100257488; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.7723018676832343, clf__colsample_bynode=0.7730488247401104, clf__colsample_bytree=0.912288322775457, clf__gamma=0.09283704456179322, clf__learning_rate=0.22456104337268815, clf__max_depth=3, clf__reg_alpha=0.13080555109971195, clf__reg_lambda=3.0680973538012397, clf__subsample=0.9696264100257488; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.7723018676832343, clf__colsample_bynode=0.7730488247401104, clf__colsample_bytree=0.912288322775457, clf__gamma=0.09283704456179322, clf__learning_rate=0.22456104337268815, clf__max_depth=3, clf__reg_alpha=0.13080555109971195, clf__reg_lambda=3.0680973538012397, clf__subsample=0.9696264100257488; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5869045459755697, clf__colsample_bynode=0.8634774697005057, clf__colsample_bytree=0.9403618922982758, clf__gamma=1.8527618162736694, clf__learning_rate=0.06955243801357099, clf__max_depth=8, clf__reg_alpha=9.814121464631345, clf__reg_lambda=2.2241111004546306, clf__subsample=0.5050099833110352; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5869045459755697, clf__colsample_bynode=0.8634774697005057, clf__colsample_bytree=0.9403618922982758, clf__gamma=1.8527618162736694, clf__learning_rate=0.06955243801357099, clf__max_depth=8, clf__reg_alpha=9.814121464631345, clf__reg_lambda=2.2241111004546306, clf__subsample=0.5050099833110352; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5869045459755697, clf__colsample_bynode=0.8634774697005057, clf__colsample_bytree=0.9403618922982758, clf__gamma=1.8527618162736694, clf__learning_rate=0.06955243801357099, clf__max_depth=8, clf__reg_alpha=9.814121464631345, clf__reg_lambda=2.2241111004546306, clf__subsample=0.5050099833110352; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.6577260490846814, clf__colsample_bynode=0.9459504140934167, clf__colsample_bytree=0.6889735593644536, clf__gamma=0.0, clf__learning_rate=0.14138755527281946, clf__max_depth=8, clf__reg_alpha=8.909470446776664, clf__reg_lambda=10.0, clf__subsample=0.6548185101793; total time= 0.5s\n",
+ "[CV] END clf__colsample_bylevel=0.6577260490846814, clf__colsample_bynode=0.9459504140934167, clf__colsample_bytree=0.6889735593644536, clf__gamma=0.0, clf__learning_rate=0.14138755527281946, clf__max_depth=8, clf__reg_alpha=8.909470446776664, clf__reg_lambda=10.0, clf__subsample=0.6548185101793; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.6577260490846814, clf__colsample_bynode=0.9459504140934167, clf__colsample_bytree=0.6889735593644536, clf__gamma=0.0, clf__learning_rate=0.14138755527281946, clf__max_depth=8, clf__reg_alpha=8.909470446776664, clf__reg_lambda=10.0, clf__subsample=0.6548185101793; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.6760642200903499, clf__colsample_bynode=0.7217263801593097, clf__colsample_bytree=0.5, clf__gamma=0.0, clf__learning_rate=0.1302835423378258, clf__max_depth=3, clf__reg_alpha=9.815881203730958, clf__reg_lambda=0.0, clf__subsample=0.6358797096074176; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.6760642200903499, clf__colsample_bynode=0.7217263801593097, clf__colsample_bytree=0.5, clf__gamma=0.0, clf__learning_rate=0.1302835423378258, clf__max_depth=3, clf__reg_alpha=9.815881203730958, clf__reg_lambda=0.0, clf__subsample=0.6358797096074176; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.6760642200903499, clf__colsample_bynode=0.7217263801593097, clf__colsample_bytree=0.5, clf__gamma=0.0, clf__learning_rate=0.1302835423378258, clf__max_depth=3, clf__reg_alpha=9.815881203730958, clf__reg_lambda=0.0, clf__subsample=0.6358797096074176; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5845839656611151, clf__colsample_bynode=0.7250250762103452, clf__colsample_bytree=0.9981700248106462, clf__gamma=9.556525989245547, clf__learning_rate=0.0010843112498718414, clf__max_depth=3, clf__reg_alpha=0.14735290535317305, clf__reg_lambda=9.238814536694226, clf__subsample=0.8995049367387801; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.5845839656611151, clf__colsample_bynode=0.7250250762103452, clf__colsample_bytree=0.9981700248106462, clf__gamma=9.556525989245547, clf__learning_rate=0.0010843112498718414, clf__max_depth=3, clf__reg_alpha=0.14735290535317305, clf__reg_lambda=9.238814536694226, clf__subsample=0.8995049367387801; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5845839656611151, clf__colsample_bynode=0.7250250762103452, clf__colsample_bytree=0.9981700248106462, clf__gamma=9.556525989245547, clf__learning_rate=0.0010843112498718414, clf__max_depth=3, clf__reg_alpha=0.14735290535317305, clf__reg_lambda=9.238814536694226, clf__subsample=0.8995049367387801; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5854967726735413, clf__colsample_bynode=0.7024935828670682, clf__colsample_bytree=0.5035777836647117, clf__gamma=9.849773665864356, clf__learning_rate=0.8756258419501888, clf__max_depth=8, clf__reg_alpha=7.504721094219438, clf__reg_lambda=5.911145882951871, clf__subsample=0.5683773486467666; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5854967726735413, clf__colsample_bynode=0.7024935828670682, clf__colsample_bytree=0.5035777836647117, clf__gamma=9.849773665864356, clf__learning_rate=0.8756258419501888, clf__max_depth=8, clf__reg_alpha=7.504721094219438, clf__reg_lambda=5.911145882951871, clf__subsample=0.5683773486467666; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5854967726735413, clf__colsample_bynode=0.7024935828670682, clf__colsample_bytree=0.5035777836647117, clf__gamma=9.849773665864356, clf__learning_rate=0.8756258419501888, clf__max_depth=8, clf__reg_alpha=7.504721094219438, clf__reg_lambda=5.911145882951871, clf__subsample=0.5683773486467666; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5402378105451193, clf__colsample_bynode=0.604715085125622, clf__colsample_bytree=1.0, clf__gamma=2.659735482461985, clf__learning_rate=1.0, clf__max_depth=5, clf__reg_alpha=6.894319369891445, clf__reg_lambda=7.265511387449289, clf__subsample=0.568226551334247; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5402378105451193, clf__colsample_bynode=0.604715085125622, clf__colsample_bytree=1.0, clf__gamma=2.659735482461985, clf__learning_rate=1.0, clf__max_depth=5, clf__reg_alpha=6.894319369891445, clf__reg_lambda=7.265511387449289, clf__subsample=0.568226551334247; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.5402378105451193, clf__colsample_bynode=0.604715085125622, clf__colsample_bytree=1.0, clf__gamma=2.659735482461985, clf__learning_rate=1.0, clf__max_depth=5, clf__reg_alpha=6.894319369891445, clf__reg_lambda=7.265511387449289, clf__subsample=0.568226551334247; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5087587974541569, clf__colsample_bynode=0.8004961908213178, clf__colsample_bytree=0.9188630786243432, clf__gamma=4.638212225913446, clf__learning_rate=0.5792966022904099, clf__max_depth=8, clf__reg_alpha=1.5878836678255284, clf__reg_lambda=3.0728173518354436, clf__subsample=1.0; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5087587974541569, clf__colsample_bynode=0.8004961908213178, clf__colsample_bytree=0.9188630786243432, clf__gamma=4.638212225913446, clf__learning_rate=0.5792966022904099, clf__max_depth=8, clf__reg_alpha=1.5878836678255284, clf__reg_lambda=3.0728173518354436, clf__subsample=1.0; total time= 0.3s\n",
+ "[CV] END clf__colsample_bylevel=0.5087587974541569, clf__colsample_bynode=0.8004961908213178, clf__colsample_bytree=0.9188630786243432, clf__gamma=4.638212225913446, clf__learning_rate=0.5792966022904099, clf__max_depth=8, clf__reg_alpha=1.5878836678255284, clf__reg_lambda=3.0728173518354436, clf__subsample=1.0; total time= 0.3s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.7157221399304734, clf__colsample_bynode=0.828021086306063, clf__colsample_bytree=0.9226383881368138, clf__gamma=0.0, clf__learning_rate=1.0, clf__max_depth=3, clf__reg_alpha=9.058785882891943, clf__reg_lambda=9.859891434716468, clf__subsample=0.5716700977212141; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.7157221399304734, clf__colsample_bynode=0.828021086306063, clf__colsample_bytree=0.9226383881368138, clf__gamma=0.0, clf__learning_rate=1.0, clf__max_depth=3, clf__reg_alpha=9.058785882891943, clf__reg_lambda=9.859891434716468, clf__subsample=0.5716700977212141; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.7157221399304734, clf__colsample_bynode=0.828021086306063, clf__colsample_bytree=0.9226383881368138, clf__gamma=0.0, clf__learning_rate=1.0, clf__max_depth=3, clf__reg_alpha=9.058785882891943, clf__reg_lambda=9.859891434716468, clf__subsample=0.5716700977212141; total time= 0.5s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.8398024088381104, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.12472446448987655, clf__max_depth=8, clf__reg_alpha=10.0, clf__reg_lambda=9.900646330789474, clf__subsample=1.0; total time= 0.5s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.8398024088381104, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.12472446448987655, clf__max_depth=8, clf__reg_alpha=10.0, clf__reg_lambda=9.900646330789474, clf__subsample=1.0; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.8398024088381104, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.12472446448987655, clf__max_depth=8, clf__reg_alpha=10.0, clf__reg_lambda=9.900646330789474, clf__subsample=1.0; total time= 0.5s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.7648740843304054, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.13509903788527342, clf__max_depth=5, clf__reg_alpha=8.919375149500015, clf__reg_lambda=2.481813646400672, clf__subsample=0.5; total time= 0.5s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.7648740843304054, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.13509903788527342, clf__max_depth=5, clf__reg_alpha=8.919375149500015, clf__reg_lambda=2.481813646400672, clf__subsample=0.5; total time= 0.5s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.7648740843304054, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.13509903788527342, clf__max_depth=5, clf__reg_alpha=8.919375149500015, clf__reg_lambda=2.481813646400672, clf__subsample=0.5; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.9358894420963616, clf__colsample_bynode=0.855282118547783, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.08435283462541183, clf__max_depth=6, clf__reg_alpha=1.2079974432107585, clf__reg_lambda=5.793583799464579, clf__subsample=0.978466442740766; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.9358894420963616, clf__colsample_bynode=0.855282118547783, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.08435283462541183, clf__max_depth=6, clf__reg_alpha=1.2079974432107585, clf__reg_lambda=5.793583799464579, clf__subsample=0.978466442740766; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.9358894420963616, clf__colsample_bynode=0.855282118547783, clf__colsample_bytree=1.0, clf__gamma=0.0, clf__learning_rate=0.08435283462541183, clf__max_depth=6, clf__reg_alpha=1.2079974432107585, clf__reg_lambda=5.793583799464579, clf__subsample=0.978466442740766; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5091891994585076, clf__colsample_bynode=0.8942779420776591, clf__colsample_bytree=0.9585526976941942, clf__gamma=0.09704478950707737, clf__learning_rate=0.001082794871840973, clf__max_depth=5, clf__reg_alpha=9.274914215839157, clf__reg_lambda=2.1283026903659943, clf__subsample=0.7630999564945671; total time= 0.5s\n",
+ "[CV] END clf__colsample_bylevel=0.5091891994585076, clf__colsample_bynode=0.8942779420776591, clf__colsample_bytree=0.9585526976941942, clf__gamma=0.09704478950707737, clf__learning_rate=0.001082794871840973, clf__max_depth=5, clf__reg_alpha=9.274914215839157, clf__reg_lambda=2.1283026903659943, clf__subsample=0.7630999564945671; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5091891994585076, clf__colsample_bynode=0.8942779420776591, clf__colsample_bytree=0.9585526976941942, clf__gamma=0.09704478950707737, clf__learning_rate=0.001082794871840973, clf__max_depth=5, clf__reg_alpha=9.274914215839157, clf__reg_lambda=2.1283026903659943, clf__subsample=0.7630999564945671; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.9667866472759579, clf__colsample_bynode=0.756589540431827, clf__colsample_bytree=0.5183109110604756, clf__gamma=0.6563749139348486, clf__learning_rate=0.8020231136861821, clf__max_depth=4, clf__reg_alpha=1.7742271736420614, clf__reg_lambda=1.6170592289744992, clf__subsample=0.9587460864107861; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.9667866472759579, clf__colsample_bynode=0.756589540431827, clf__colsample_bytree=0.5183109110604756, clf__gamma=0.6563749139348486, clf__learning_rate=0.8020231136861821, clf__max_depth=4, clf__reg_alpha=1.7742271736420614, clf__reg_lambda=1.6170592289744992, clf__subsample=0.9587460864107861; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.9667866472759579, clf__colsample_bynode=0.756589540431827, clf__colsample_bytree=0.5183109110604756, clf__gamma=0.6563749139348486, clf__learning_rate=0.8020231136861821, clf__max_depth=4, clf__reg_alpha=1.7742271736420614, clf__reg_lambda=1.6170592289744992, clf__subsample=0.9587460864107861; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5225167054873755, clf__colsample_bynode=0.7203413284241602, clf__colsample_bytree=1.0, clf__gamma=10.0, clf__learning_rate=0.03681144114853299, clf__max_depth=4, clf__reg_alpha=0.0, clf__reg_lambda=6.01677944462046, clf__subsample=0.5880016600496364; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5225167054873755, clf__colsample_bynode=0.7203413284241602, clf__colsample_bytree=1.0, clf__gamma=10.0, clf__learning_rate=0.03681144114853299, clf__max_depth=4, clf__reg_alpha=0.0, clf__reg_lambda=6.01677944462046, clf__subsample=0.5880016600496364; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.5225167054873755, clf__colsample_bynode=0.7203413284241602, clf__colsample_bytree=1.0, clf__gamma=10.0, clf__learning_rate=0.03681144114853299, clf__max_depth=4, clf__reg_alpha=0.0, clf__reg_lambda=6.01677944462046, clf__subsample=0.5880016600496364; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.6166765512396893, clf__colsample_bynode=0.8475533219148963, clf__colsample_bytree=0.7210162320615964, clf__gamma=0.0, clf__learning_rate=0.001, clf__max_depth=2, clf__reg_alpha=0.0, clf__reg_lambda=2.3346893450449215, clf__subsample=0.6837672488303974; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.6166765512396893, clf__colsample_bynode=0.8475533219148963, clf__colsample_bytree=0.7210162320615964, clf__gamma=0.0, clf__learning_rate=0.001, clf__max_depth=2, clf__reg_alpha=0.0, clf__reg_lambda=2.3346893450449215, clf__subsample=0.6837672488303974; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.6166765512396893, clf__colsample_bynode=0.8475533219148963, clf__colsample_bytree=0.7210162320615964, clf__gamma=0.0, clf__learning_rate=0.001, clf__max_depth=2, clf__reg_alpha=0.0, clf__reg_lambda=2.3346893450449215, clf__subsample=0.6837672488303974; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.9406437118721191, clf__colsample_bynode=0.7481377937916189, clf__colsample_bytree=0.5076126608722743, clf__gamma=0.389296454396082, clf__learning_rate=0.021406691167827296, clf__max_depth=4, clf__reg_alpha=4.469298231686083, clf__reg_lambda=3.9552062576301483, clf__subsample=0.6130527840407582; total time= 0.5s\n",
+ "[CV] END clf__colsample_bylevel=0.9406437118721191, clf__colsample_bynode=0.7481377937916189, clf__colsample_bytree=0.5076126608722743, clf__gamma=0.389296454396082, clf__learning_rate=0.021406691167827296, clf__max_depth=4, clf__reg_alpha=4.469298231686083, clf__reg_lambda=3.9552062576301483, clf__subsample=0.6130527840407582; total time= 0.4s\n",
+ "[CV] END clf__colsample_bylevel=0.9406437118721191, clf__colsample_bynode=0.7481377937916189, clf__colsample_bytree=0.5076126608722743, clf__gamma=0.389296454396082, clf__learning_rate=0.021406691167827296, clf__max_depth=4, clf__reg_alpha=4.469298231686083, clf__reg_lambda=3.9552062576301483, clf__subsample=0.6130527840407582; total time= 0.4s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=0.5806962212230957, clf__colsample_bynode=0.7586902863302571, clf__colsample_bytree=0.7552310835375295, clf__gamma=10.0, clf__learning_rate=0.001, clf__max_depth=6, clf__reg_alpha=7.911043668944454, clf__reg_lambda=9.156553339386216, clf__subsample=0.7459268575731307; total time= 0.5s\n",
+ "[CV] END clf__colsample_bylevel=0.5806962212230957, clf__colsample_bynode=0.7586902863302571, clf__colsample_bytree=0.7552310835375295, clf__gamma=10.0, clf__learning_rate=0.001, clf__max_depth=6, clf__reg_alpha=7.911043668944454, clf__reg_lambda=9.156553339386216, clf__subsample=0.7459268575731307; total time= 0.6s\n",
+ "[CV] END clf__colsample_bylevel=0.5806962212230957, clf__colsample_bynode=0.7586902863302571, clf__colsample_bytree=0.7552310835375295, clf__gamma=10.0, clf__learning_rate=0.001, clf__max_depth=6, clf__reg_alpha=7.911043668944454, clf__reg_lambda=9.156553339386216, clf__subsample=0.7459268575731307; total time= 0.6s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.5, clf__colsample_bytree=0.8467569097961967, clf__gamma=0.0, clf__learning_rate=0.10115118530494382, clf__max_depth=6, clf__reg_alpha=0.0, clf__reg_lambda=0.0, clf__subsample=0.5; total time= 0.8s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.5, clf__colsample_bytree=0.8467569097961967, clf__gamma=0.0, clf__learning_rate=0.10115118530494382, clf__max_depth=6, clf__reg_alpha=0.0, clf__reg_lambda=0.0, clf__subsample=0.5; total time= 0.9s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.5, clf__colsample_bytree=0.8467569097961967, clf__gamma=0.0, clf__learning_rate=0.10115118530494382, clf__max_depth=6, clf__reg_alpha=0.0, clf__reg_lambda=0.0, clf__subsample=0.5; total time= 0.9s\n",
+ "Fitting 3 folds for each of 1 candidates, totalling 3 fits\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.8802262489618233, clf__colsample_bytree=0.6471340731814139, clf__gamma=0.0, clf__learning_rate=0.11747225832482089, clf__max_depth=5, clf__reg_alpha=10.0, clf__reg_lambda=0.18422807726505983, clf__subsample=1.0; total time= 0.6s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.8802262489618233, clf__colsample_bytree=0.6471340731814139, clf__gamma=0.0, clf__learning_rate=0.11747225832482089, clf__max_depth=5, clf__reg_alpha=10.0, clf__reg_lambda=0.18422807726505983, clf__subsample=1.0; total time= 0.7s\n",
+ "[CV] END clf__colsample_bylevel=1.0, clf__colsample_bynode=0.8802262489618233, clf__colsample_bytree=0.6471340731814139, clf__gamma=0.0, clf__learning_rate=0.11747225832482089, clf__max_depth=5, clf__reg_alpha=10.0, clf__reg_lambda=0.18422807726505983, clf__subsample=1.0; total time= 0.7s\n"
+ ]
+ },
+ {
+ "data": {
+ "text/html": [
+ "
In a Jupyter environment, please rerun this cell to show the HTML representation or trust the notebook. On GitHub, the HTML representation is unable to render, please try loading this page with nbviewer.org.
In a Jupyter environment, please rerun this cell to show the HTML representation or trust the notebook. On GitHub, the HTML representation is unable to render, please try loading this page with nbviewer.org.