CL1-Codes

Instructions and solutions to common issues (please read) ->

Say you want to download the binarySearch.py file through the terminal, just enter in the following command:
```
`wget https://raw.githubusercontent.com/kh4l1d/CL3-Codes/master/binarySearch.py`
```
It's of the form:
```
`wget URL/file.txt`
```
Although it is worth mentioning that repos should ideally be "git clone"-d like this: https://www.youtube.com/watch?v=oDUOWC4yib0

Please see the link mentioned in the code to understand what's going on.
To get the sequence in which cities were travelled, print out the contents of a when i==n
While constructing the graph, make sure that in the matrix you plot - if a path doesn't exist from say A to B,then assign a value like 999 to that place (a large value indicates that a path does not exist between those vertices).
Make sure that the initial value assigned to cost is huge compared to the costs you assign when there is no existing path between cities. For example, in the above point, we assigned 999 - so make sure your initial cost is something like 9999.

Make sure the centroid you choose,belongs to one of the points.
The end result of the centroids will always be same (provided the points are same of course) as the code runs till hasAchievedPerfectCentroids = true.

Keep in mind, the 0/1 knapsack problem is solved using the branch and bound approach.
Watch this video for a proper explanation.

If you installed bison:

 bison -d <yacc_file>.y
 flex <lex_file>.l
 gcc lex.yy.c <yacc_file>.tab.c -lm
 ./a.out

If not:

 yacc -d <yacc_file>.y
 flex <lex_file>.l
 gcc lex.yy.c <yacc_file>.tab.c -lm
 ./a.out

Name		Name	Last commit message	Last commit date
Latest commit History 53 Commits
8queens		8queens
Intermediate code generation		Intermediate code generation
Lexical analyzer		Lexical analyzer
Parser for sample language		Parser for sample language
Apriori.java		Apriori.java
README.md		README.md
binarySearch.cpp		binarySearch.cpp
kMeans.cpp		kMeans.cpp
kNN.cpp		kNN.cpp
knapsack.cpp		knapsack.cpp
naiveBayesConcurrent.cpp		naiveBayesConcurrent.cpp
quickSort.cpp		quickSort.cpp
recursiveDescentParser.py		recursiveDescentParser.py
travellingSalesman.cpp		travellingSalesman.cpp