SYMBOL INDEX (1001 symbols across 231 files)

FILE: BST/BinarySearchTree.java
  class BinarySearchTree (line 4) | public class BinarySearchTree {
    class Node (line 7) | class Node {
      method Node (line 11) | public Node(int item) {
    method BinarySearchTree (line 21) | BinarySearchTree() {
    method insert (line 26) | void insert(int key) {
    method insertRec (line 31) | Node insertRec(Node root, int key) {
    method inorder (line 50) | void inorder()  {
    method inorderRec (line 55) | void inorderRec(Node root) {
    method preorder (line 65) | void preorder()  {
    method preorderRec (line 70) | void preorderRec(Node root) {
    method postorder (line 80) | void postorder()  {
    method postorderRec (line 85) | void postorderRec(Node root) {
  class Main (line 97) | public class Main {
    method main (line 98) | public static void main(String args[])

FILE: BST/Delete.c
  type tree (line 4) | struct tree{
  type tree (line 10) | struct tree
  type tree (line 12) | struct tree
  type tree (line 12) | struct tree
  type tree (line 19) | struct tree
  type tree (line 19) | struct tree
  function preorder (line 32) | void preorder(struct tree* n)
  function main (line 46) | void main()

FILE: BST/Height.c
  type tree (line 4) | struct tree{
  type tree (line 10) | struct tree
  type tree (line 12) | struct tree
  type tree (line 12) | struct tree
  type tree (line 12) | struct tree
  function height (line 19) | int height(struct tree* n)
  function node (line 37) | int node(struct tree* n)
  function main (line 50) | void main()

FILE: BST/Insert & Search.cpp
  type node (line 14) | struct node
    type node (line 17) | struct node
    type node (line 18) | struct node
  type node (line 21) | struct node
    type node (line 17) | struct node
    type node (line 18) | struct node
  type node (line 22) | struct node
    type node (line 17) | struct node
    type node (line 18) | struct node
  type node (line 29) | struct node
    type node (line 17) | struct node
    type node (line 18) | struct node
  type node (line 29) | struct node
    type node (line 17) | struct node
    type node (line 18) | struct node
  function search (line 44) | int search(struct node* root, int data){
  function main (line 62) | int main()

FILE: BST/MinMax_8.c
  type tree (line 3) | struct tree{
  type tree (line 8) | struct tree
  type tree (line 10) | struct tree
  type tree (line 10) | struct tree
  type tree (line 16) | struct tree
  type tree (line 16) | struct tree
  function Preo (line 27) | void Preo(struct tree* n)
  function main (line 39) | void main()

FILE: BST/createBST.cpp
  type BST (line 4) | struct BST
    type BST (line 7) | struct BST
    type BST (line 8) | struct BST
  function main (line 15) | int main()
  function node (line 38) | node *create()
  function insert (line 48) | void insert(node *root,node *temp)
  function preorder (line 67) | void preorder(node *root)

FILE: BST/lca.cpp
  type node (line 21) | struct node{
    type node (line 23) | struct node
    type node (line 24) | struct node
  type node (line 28) | struct node
    type node (line 23) | struct node
    type node (line 24) | struct node
  type node (line 29) | struct node
    type node (line 23) | struct node
    type node (line 24) | struct node
  type node (line 37) | struct node
    type node (line 23) | struct node
    type node (line 24) | struct node
  type node (line 37) | struct node
    type node (line 23) | struct node
    type node (line 24) | struct node
  function lca (line 54) | int lca(node* root, int val1, int val2){
  function main (line 72) | int main(){

FILE: BST/spiraltransversal.c
  type node (line 6) | struct node{
  type node (line 11) | struct node
  type node (line 13) | struct node
  type node (line 13) | struct node
  type node (line 17) | struct node
  type node (line 17) | struct node
  function inorder (line 34) | void inorder(struct node* rootptr)
  function printGivenLevel (line 43) | void printGivenLevel(struct node* root, int level, int ltr)
  function height (line 64) | int height(struct node* node)
  function printSpiral (line 81) | void printSpiral(struct node* root)

FILE: Backtrack/NQueen.cpp
  function isSafe (line 4) | bool isSafe(char board[][100], int row, int column, int n){
  function nqueen (line 37) | bool nqueen(char board[][100], int n, int i=0){
  function main (line 60) | int main(){

FILE: Backtrack/Rat_Maze_Recurssion_Backtracking.c
  function display (line 4) | void display(int sol[N][N])
  function issafe (line 16) | int issafe(int maze[N][N],int x,int y)
  function solvemaze (line 24) | int solvemaze(int maze[N][N],int x,int y,int sol[N][N])
  function solve (line 48) | void solve(int maze[N][N])
  function main (line 60) | void main()

FILE: Backtrack/nqueen_allsol.py
  function initialize (line 1) | def initialize(board,n):
  function placequeen (line 14) | def placequeen(r,board,n):
  function printboard (line 17) | def printboard(board,n):
  function isfree (line 22) | def isfree(i,j,board):
  function addqueen (line 25) | def addqueen(i,j,board):
  function undoqueen (line 32) | def undoqueen(i,j,board):
  function placequeen (line 39) | def placequeen(i,board,n):

FILE: Backtrack/permutations_of_string.cpp
  function swap (line 5) | void swap(char *x, char *y)
  function permute (line 18) | void permute(char *a, int l, int r)
  function main (line 34) | int main()

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/buy_max_with_given_money.cpp
  function sort_fxn (line 30) | bool sort_fxn(mp a,mp b){
  function ulli (line 41) | ulli buyMaximumProducts(ulli n, ulli k, vector <ulli> a) {
  function main (line 59) | int main() {

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/median searching efficientalgo.cpp
  function main (line 8) | int main()
  function median (line 26) | int median(int *a,int s,int r,int k)
  function pivot (line 69) | int pivot(int *a,int s,int r)

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/ques-beat_the_clock/spiral_matrix.cpp
  function func (line 34) | vector<int> func(vector<vector<int> > vec,int m,int n){
  function main (line 73) | int main(){

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/ques-l1/codeforces_426_2.cpp
  function main (line 6) | int main(){

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/ques-l1/positions.cpp
  function main (line 5) | int main(){

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/ques-l1/snake/snake.cpp
  function fill (line 31) | void fill(matrix& mat,int x,int y,int d,int n){
  function main (line 119) | int main(){

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/ques-l1/snake/wrong_snake.cpp
  function movehu (line 31) | void movehu(matrix& mat,int x,int y,int num,int n){
  function movehd (line 59) | void movehd(matrix& mat,int x,int y,int num,int n){
  function movevl (line 87) | void movevl(matrix& mat,int x,int y,int num,int n){
  function movevr (line 115) | void movevr(matrix& mat,int x,int y,int num,int n){
  function fill (line 145) | void fill(matrix& mat,int x,int y,int d,int n){
  function main (line 164) | int main(){

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/ques/volcano.cpp
  type elem (line 29) | struct elem{
    method elem (line 33) | elem(int x,int y,int w){
  function fill (line 42) | void fill(int x,int y,int w,int n,matrix& mat,matrix& filled){
  function main (line 70) | int main(){

FILE: Competitive Programming Challenges/C:C++/HackerEarth:CodeForces/searchmat.cpp
  function main (line 5) | int main(){

FILE: Competitive Programming Challenges/C:C++/Patterns/pattern1.cpp
  function main (line 4) | int main(){

FILE: Competitive Programming Challenges/C:C++/Patterns/pattern2.cpp
  function main (line 4) | int main(){

FILE: Competitive Programming Challenges/C:C++/Patterns/pattern3.cpp
  function main (line 4) | int main(){

FILE: Competitive Programming Challenges/C:C++/Patterns/pattern4.cpp
  function main (line 4) | int main(){

FILE: Competitive Programming Challenges/C:C++/Patterns/pattern6.cpp
  function main (line 4) | int main(){

FILE: Competitive Programming Challenges/C:C++/Patterns/pattern7.cpp
  function main (line 4) | int main(){

FILE: Conversions/C:C++/binary2octal.c
  function three_digits (line 5) | int three_digits(int n)
  function main (line 19) | int main(void)

FILE: Data Structures/C:C++/Applications/Evaluating Postfix Expression.c
  function isoperator (line 5) | int isoperator(char c){
  type stack (line 9) | struct stack
  function push (line 15) | void push(double c){
  function pop (line 19) | double pop(){
  function perform (line 23) | double perform(double a, double b, char c){
  function post_infix (line 39) | void post_infix(char a[],int l){
  function main (line 58) | int main()

FILE: Data Structures/C:C++/Applications/Infix to Postfix.c
  type temp (line 4) | struct temp{
  type temp (line 8) | struct temp
  function push (line 10) | void push(char item){
  function isempty (line 14) | int isempty(){
  function pop (line 18) | char pop(){
  function isoperator (line 22) | int isoperator(char c){
  function precedence (line 26) | int precedence(char c){
  function main (line 66) | int main(){

FILE: Data Structures/C:C++/Applications/balance parenthesis.cpp
  function main (line 7) | int main(){

FILE: Data Structures/C:C++/Applications/stack_and_its_implementation.c
  type stack (line 7) | struct stack{
  type stack (line 14) | struct stack
  function push (line 17) | void push(){
  function pop (line 33) | void pop(){
  function peep (line 42) | void peep(){
  function print (line 50) | void print(){
  function main (line 64) | int main(){

FILE: Data Structures/C:C++/Graph/FloydWarshall.cpp
  function ll (line 10) | ll gcd(ll a , ll b){return a==0?b:gcd(b%a,a);}
  function main (line 12) | int main(){

FILE: Data Structures/C:C++/Graph/adjacency_list.hpp
  class graph_al (line 7) | class graph_al {
    method graph_al (line 14) | graph_al(T vertices[], int count) : count(count), visited(new bool[cou...
    method connect (line 20) | void connect(int i, int j){
    method connect_both_sides (line 24) | void connect_both_sides(int i, int j){
    method contains (line 29) | bool contains(vector<int> v, int n){
    method bfs (line 33) | bool bfs(int i, int j){
    method dfs (line 52) | void dfs(int i){
    method connected (line 62) | bool connected(int i, int j){
    method print_graph (line 66) | void print_graph(){
    method connected_components (line 78) | int connected_components(){

FILE: Data Structures/C:C++/Graph/adjacency_matrix.hpp
  class graph_am (line 6) | class graph_am {
    method graph_am (line 13) | graph_am(T vertices[], int count) : count(count), vertices(new T[count...
    method connect (line 26) | void connect(int i, int j){
    method connect_both_sides (line 30) | void connect_both_sides(int i, int j){
    method bfs (line 35) | bool bfs(int i, int j){
    method dfs (line 55) | void dfs(int i){
    method connected (line 65) | bool connected(int i, int j){
    method connected_components (line 69) | int connected_components(){

FILE: Data Structures/C:C++/Graph/bfs_dfs/bfs/BFS.java
  class BFS (line 31) | class BFS {
    method main (line 41) | public static void main(String[] args) {
    method readMatrixFromFile (line 47) | private static int[][] readMatrixFromFile() {
    method bfs (line 73) | private static List<Integer> bfs(int[][] matrix) {
    method printSolution (line 93) | private static void printSolution(List<Integer> way) {

FILE: Data Structures/C:C++/Graph/bfs_dfs/bfs/bfs.Py
  class Graph (line 8) | class Graph:
    method __init__ (line 11) | def __init__(self):
    method addEdge (line 17) | def addEdge(self,u,v):
    method BFS (line 21) | def BFS(self, s):

FILE: Data Structures/C:C++/Graph/bfs_dfs/ques/graph_connected_components.cpp
  function dfs (line 8) | void dfs(int s) {
  function initialize (line 16) | void initialize() {
  function main (line 21) | int main() {

FILE: Data Structures/C:C++/Graph/bfs_dfs/ques/tbbfs.cpp
  class Node (line 7) | class Node{
    method Node (line 12) | Node(){
    method clear (line 15) | void clear(){
  function dfs_rec (line 21) | void dfs_rec(vector<Node> &node,int a){
  function dfs (line 30) | void dfs(vector<Node> &node,int a){
  function bfs (line 41) | void bfs(vector<Node> &node,int a){
  function main (line 63) | int main(){

FILE: Data Structures/C:C++/Graph/dijakstra/Dijkstra.java
  class Dijkstra (line 31) | public class Dijkstra {
    method main (line 43) | public static void main(String[] args) {
    method readMatrixFromFile (line 48) | private static int[][] readMatrixFromFile() {
    method dijkstra (line 75) | private static void dijkstra(int[][] matrix) {
    method printSolution (line 112) | private static void printSolution(int[] trip, int[] dist) {

FILE: Data Structures/C:C++/Graph/dijakstra/dist_from_source.cpp
  class Node (line 7) | class Node{
    method clear (line 12) | void clear(){
  type priority_fxn (line 18) | struct priority_fxn{
  function dijakstra (line 23) | void dijakstra(int source){
  function main (line 45) | int main(){

FILE: Data Structures/C:C++/Graph/dijakstra/dist_from_source_oops.cpp
  class Road (line 9) | class Road{
    method Road (line 15) | Road(int l,int r,int d){
  class Node (line 22) | class Node{
    method Node (line 27) | Node(){
  type priority_fxn (line 34) | struct priority_fxn{
  function dijakstra (line 45) | void dijakstra(vector<Node> &ct,int root){
  function main (line 69) | int main()

FILE: Data Structures/C:C++/Graph/dijakstra/ques/min_path.cpp
  class Node (line 11) | class Node{
    method clear (line 17) | void clear(){
    method Node (line 22) | Node(){
    method setparent (line 25) | void setparent(ulli px,ulli py){
  type priority_fxn (line 31) | struct priority_fxn{
  function dijakstra (line 36) | void dijakstra(ulli sx,ulli sy,ulli ex,ulli ey,ulli update){
  function main (line 83) | int main(){

FILE: Data Structures/C:C++/Graph/dijakstra/ques/qgrid_11.cpp
  class Node (line 8) | class Node{
    method clear (line 14) | void clear(){
    method Node (line 19) | Node(){
    method setparent (line 22) | void setparent(ulli px,ulli py){
  type priority_fxn (line 28) | struct priority_fxn{
  function update_weight (line 34) | void update_weight(ulli l,ulli r,ulli update){
  function dijakstra (line 41) | void dijakstra(ulli sx,ulli sy,ulli ex,ulli ey,ulli update){
  function main (line 86) | int main(){

FILE: Data Structures/C:C++/Graph/shortest_paths.hpp
  function unweighted_shortest_path (line 9) | pair< vector<int>, vector<int> > unweighted_shortest_path(vector< vector...

FILE: Data Structures/C:C++/Graph/topological_sort.hpp
  function _ts (line 7) | void _ts(int v, bool visited[], stack<int> *st, vector< vector<int> > gr...
  function topological_sort (line 19) | stack<int> topological_sort(vector< vector<int> > graph){

FILE: Data Structures/C:C++/Graph/tree/binarySearchTree/bsTree.cpp
  type tree (line 15) | struct tree{
  function insert (line 25) | void insert(tree *curr, tree *node){
  function tree (line 70) | tree * minValueNode( tree *curr){
  function tree (line 79) | tree* deleteNode(tree *root, int key){
  function Kpify (line 115) | int Kpify(tree *curr, int pos, int target){
  function main (line 137) | int main(){

FILE: Data Structures/C:C++/Linked List/Circular_LL.c
  type node (line 12) | struct node
  type node (line 20) | struct node
  type node (line 23) | struct node
  type node (line 33) | struct node
  type node (line 33) | struct node
  type node (line 33) | struct node
  function countNode (line 41) | int countNode(){
  function insert_beg (line 59) | void insert_beg(){
  function insert_btw (line 77) | void insert_btw(){
  function insert_end (line 102) | void insert_end(){
  function delete_beg (line 123) | void delete_beg(){
  function delete_btw (line 140) | void delete_btw(){
  function delete_end (line 167) | void delete_end(){
  function search (line 180) | void search(){
  function display (line 204) | void display(){
  function main (line 217) | int main()

FILE: Data Structures/C:C++/Linked List/Circular_ll.cpp
  type node (line 11) | struct node
    type node (line 14) | struct node
  class circular_llist (line 20) | class circular_llist
    method circular_llist (line 31) | circular_llist()
  function main (line 40) | int main()
  type node (line 128) | struct node
    type node (line 14) | struct node
  type node (line 154) | struct node
    type node (line 14) | struct node
  type node (line 171) | struct node
    type node (line 14) | struct node
  type node (line 199) | struct node
    type node (line 14) | struct node
  type node (line 247) | struct node
    type node (line 14) | struct node
  type node (line 276) | struct node
    type node (line 14) | struct node
  type node (line 307) | struct node
    type node (line 14) | struct node
  type node (line 328) | struct node
    type node (line 14) | struct node

FILE: Data Structures/C:C++/Linked List/Doubly LL.c
  type node (line 12) | struct node
  type node (line 21) | struct node
  type node (line 24) | struct node
  type node (line 34) | struct node
  type node (line 34) | struct node
  type node (line 34) | struct node
  function countNode (line 43) | int countNode(){
  function insert_beg (line 61) | void insert_beg(){
  function insert_btw (line 71) | void insert_btw(){
  function insert_end (line 96) | void insert_end(){
  function delete_beg (line 113) | void delete_beg(){
  function delete_btw (line 125) | void delete_btw(){
  function delete_end (line 167) | void delete_end(){
  function search (line 179) | void search(){
  function display (line 203) | void display(){
  function main (line 216) | int main()

FILE: Data Structures/C:C++/Linked List/Insertion_Deletion_SinglyLL.c
  type node (line 3) | struct node{
  type node (line 8) | struct node
  function Insert (line 10) | void Insert(){
  function delete (line 23) | void delete(){
  function Print (line 45) | void Print(){
  function main (line 54) | int main(){

FILE: Data Structures/C:C++/Linked List/Queue using LinkedList.cpp
  type Node (line 10) | struct Node {
    type Node (line 12) | struct Node
  type Node (line 15) | struct Node
    type Node (line 12) | struct Node
  type Node (line 16) | struct Node
    type Node (line 12) | struct Node
  function Enqueue (line 19) | void Enqueue(int x) {
  function Dequeue (line 33) | void Dequeue() {
  function Front (line 48) | int Front() {
  function Print (line 56) | void Print() {
  function main (line 65) | int main(){

FILE: Data Structures/C:C++/Linked List/Queue_using_linkedlist.c
  type node (line 5) | struct node{
  type node (line 10) | struct node
  function push (line 12) | void push(){//insert at the beginning
  function pop (line 25) | void pop(){
  function display (line 42) | void display(){
  function main (line 54) | int main(){

FILE: Data Structures/C:C++/Linked List/Reverse_SinglyLL.c
  type node (line 3) | struct node{
  type node (line 8) | struct node
  type node (line 10) | struct node
  type node (line 11) | struct node
  type node (line 12) | struct node
  type node (line 13) | struct node
  function insert (line 26) | void insert(int item,int n){
  function print (line 46) | void print(){
  function main (line 55) | int main(){

FILE: Data Structures/C:C++/Linked List/all_operations_of_Doubly_ll.cpp
  type node (line 11) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node
  class double_llist (line 21) | class double_llist
    method double_llist (line 32) | double_llist()
  function main (line 41) | int main()
  type node (line 123) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node
  type node (line 152) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node
  type node (line 172) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node
  type node (line 208) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node
  type node (line 251) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node
  type node (line 272) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node
  type node (line 287) | struct node
    type node (line 14) | struct node
    type node (line 15) | struct node

FILE: Data Structures/C:C++/Linked List/concatinate.c
  type node (line 4) | struct node
  type node (line 9) | struct node
  type node (line 10) | struct node
  type node (line 13) | struct node
  type node (line 13) | struct node
  type node (line 15) | struct node
  type node (line 16) | struct node
  type node (line 16) | struct node
  type node (line 37) | struct node
  type node (line 37) | struct node
  type node (line 39) | struct node
  type node (line 40) | struct node
  type node (line 40) | struct node
  function display (line 62) | void display(struct node*start)
  type node (line 74) | struct node
  type node (line 74) | struct node
  type node (line 77) | struct node
  function con (line 95) | void con(struct node*p,struct node*q)
  type node (line 106) | struct node

FILE: Data Structures/C:C++/Linked List/doubly circular.c
  type node (line 12) | struct node
  type node (line 21) | struct node
  type node (line 22) | struct node
  type node (line 25) | struct node
  type node (line 35) | struct node
  type node (line 35) | struct node
  type node (line 35) | struct node
  function countNode (line 44) | int countNode(){
  function insert_beg (line 62) | void insert_beg(){
  function insert_btw (line 89) | void insert_btw(){//problem hai...
  function insert_end (line 126) | void insert_end(){
  function delete_beg (line 147) | void delete_beg(){
  function delete_btw (line 166) | void delete_btw(){
  function delete_end (line 212) | void delete_end(){
  function search (line 226) | void search(){
  function display (line 250) | void display(){
  function main (line 263) | int main()

FILE: Data Structures/C:C++/Linked List/doubly linked list.c
  type node (line 3) | struct node{
  type node (line 9) | struct node
  type node (line 11) | struct node
  type node (line 12) | struct node
  type node (line 12) | struct node
  function insert (line 22) | void insert(){
  function insert1 (line 33) | void insert1(){
  function print (line 51) | void print(){
  function main (line 60) | int main(){

FILE: Data Structures/C:C++/Linked List/linked_list.c
  type node (line 4) | struct node
  type node (line 12) | struct node
  type node (line 14) | struct node
  type node (line 15) | struct node
  type node (line 15) | struct node
  type node (line 15) | struct node
  type node (line 22) | struct node
  type node (line 23) | struct node
  function countNode (line 29) | int countNode(){
  function ins_beg (line 39) | void ins_beg(int roll,char name[], float cgpa){
  function ins_btw (line 45) | void ins_btw(int roll,char name[], float cgpa,int pos){
  function ins_end (line 62) | void ins_end(int roll,char name[], float cgpa){
  function del_beg (line 76) | void del_beg(){
  function del_btw (line 83) | void del_btw(int pos){
  function del_end (line 99) | void del_end(){
  function search (line 109) | void search(int roll){
  function DISPLAY (line 126) | void DISPLAY(){
  function main (line 137) | int main()

FILE: Data Structures/C:C++/Linked List/ordered_linked.c
  type node (line 4) | struct node
  type node (line 12) | struct node
  type node (line 14) | struct node
  type node (line 15) | struct node
  type node (line 15) | struct node
  type node (line 15) | struct node
  type node (line 23) | struct node
  type node (line 24) | struct node
  function countNode (line 30) | int countNode(){
  function insert (line 40) | void insert(int roll,char name[], float cgpa){
  function del_beg (line 97) | void del_beg(){
  function del_btw (line 102) | void del_btw(int pos){
  function del_end (line 115) | void del_end(){
  function search (line 125) | void search(int roll){
  function DISPLAY (line 142) | void DISPLAY(){
  function main (line 153) | int main()

FILE: Data Structures/C:C++/Linked List/reverse.cpp
  type node (line 5) | struct node
    type node (line 8) | struct node
  type node (line 11) | struct node
    type node (line 8) | struct node
  type node (line 11) | struct node
    type node (line 8) | struct node
  type node (line 13) | struct node
    type node (line 8) | struct node
  type node (line 14) | struct node
    type node (line 8) | struct node
  type node (line 14) | struct node
    type node (line 8) | struct node
  function display (line 34) | void display()
  function reverse (line 47) | void reverse()
  function main (line 64) | int main()

FILE: Data Structures/C:C++/Linked List/stackLinkedList.cpp
  type node (line 3) | struct node{
    type node (line 5) | struct node
  type node (line 8) | struct node
    type node (line 5) | struct node
  function insertathead (line 11) | void insertathead(){
  function pop (line 26) | void pop(){
  function print (line 40) | void print(){
  function main (line 51) | int main(){

FILE: Data Structures/C:C++/Linked List/stack_Linked_List.c
  type node (line 14) | struct node{
  type stack (line 19) | struct stack{
  type node (line 23) | typedef struct node node;
  type stack (line 24) | typedef struct stack stack;
  function stack (line 27) | stack* createStack(){
  function push (line 35) | void push(stack *s,int data){
  function pop (line 56) | int pop(stack *s){
  function isEmpty (line 73) | int isEmpty(stack *s){
  function top (line 79) | int top(stack *s){
  function main (line 88) | int main(){

FILE: Data Structures/C:C++/Stack/Balanced_Brackets.cpp
  function main (line 8) | int main()

FILE: Data Structures/C:C++/Stack/Reverse_Queue.cpp
  function Print (line 9) | void Print(queue<int>& Queue)
  function reverseQueue (line 18) | void reverseQueue(queue<int>& Queue)
  function main (line 32) | int main()

FILE: Data Structures/C:C++/Stack/Stack_as_linked_list.cpp
  type node (line 8) | struct node
    type node (line 11) | struct node
  class stack (line 15) | class stack
    type node (line 17) | struct node
    method stack (line 19) | stack() // constructure
  type node (line 31) | struct node
    type node (line 11) | struct node
  type node (line 48) | struct node
    type node (line 11) | struct node
  type node (line 62) | struct node
    type node (line 11) | struct node
  function main (line 73) | int main()

FILE: Data Structures/C:C++/Stack/largestRectangleHistogram.cpp
  function main (line 5) | int main() {

FILE: Data Structures/C:C++/Stack/stack.hpp
  type stackmp (line 6) | struct stackmp{
    method stackmp (line 11) | stackmp(int cap) : capacity(cap),size(0) {}
    method push (line 13) | void push(T new_data){
    method print (line 25) | void print(){
    method T (line 39) | T pop(){
    method T (line 50) | T peek(){
  function get_size (line 56) | int get_size(stackmp<T> *s){
  function get_capacity (line 61) | int get_capacity(stackmp<T> *s){

FILE: Data Structures/C:C++/Trees/segment_tree/segment_tree.cpp
  function createMinSegmentTree (line 5) | void createMinSegmentTree(int arr[],int sg[],int index,int begin,int end){
  function queryMinSegmentTree (line 19) | int queryMinSegmentTree(int sg[],int l,int r,int index,int begin,int end){
  function updateMinSegmentTree (line 38) | void updateMinSegmentTree(int sg[],int l,int r,int index,int begin,int e...
  function main (line 56) | int main(){

FILE: Data Structures/C:C++/Trees/segment_tree/segment_trees_lazy.cpp.cpp
  function build_tree (line 29) | void build_tree(int node, int a, int b) {
  function update_tree (line 46) | void update_tree(int node, int a, int b, int i, int j, int value) {
  function query_tree (line 82) | int query_tree(int node, int a, int b, int i, int j) {
  function main (line 108) | int main() {

FILE: Data Structures/C:C++/Trees/tree/Fenwick_tree.cpp
  function update (line 4) | void update(int x, int delta)
  function query (line 9) | int query(int x)
  function main (line 17) | int main()

FILE: Data Structures/C:C++/Trees/tree/bst.hpp
  type bst_node (line 6) | struct bst_node{
    method bst_node (line 11) | bst_node(T new_data) : data(new_data), left_child(NULL), right_child(N...
  class BST (line 15) | class BST{
    method _get_length (line 20) | int _get_length(bst_node<T> *node){
    method _insert (line 25) | void _insert(bst_node<T> *node, T new_data){
    method _print (line 44) | void _print(bst_node<T> *node){
    method _print_post_order (line 51) | void _print_post_order(bst_node<T> *node){
    method _print_pre_order (line 58) | void _print_pre_order(bst_node<T> *node){
    method _count_nodes (line 65) | int _count_nodes(bst_node<T> *node){
    method _find (line 70) | bool _find(bst_node<T> *node, T data){
    method _print_max_path (line 85) | void _print_max_path(bst_node<T> *node){
    method T (line 95) | T _get_max(bst_node<T> *node){
    method T (line 104) | T _get_min(bst_node<T> *node){
    method _get_count (line 150) | int _get_count(bst_node<T> *node){
    method _level_order (line 155) | void _level_order(bst_node<T> *node){
    method BST (line 170) | BST() : node(NULL) {}
    method BST (line 171) | BST(T new_data) : node(new bst_node<T>(new_data)) {}
    method T (line 174) | T data(){
    method insert (line 178) | void insert(T new_data){
    method get_length (line 187) | int get_length(){
    method print (line 191) | void print(){
    method print_post_order (line 197) | void print_post_order(){
    method print_pre_order (line 203) | void print_pre_order(){
    method T (line 209) | T get_max(){
    method T (line 213) | T get_min(){
    method count_nodes (line 217) | int count_nodes(){
    method find (line 221) | bool find(T data){
    method print_max_path (line 225) | void print_max_path(){
    method delete_value (line 231) | void delete_value(T del_data){
    method get_count (line 235) | int get_count(){
    method level_order (line 239) | void level_order(){

FILE: Data Structures/C:C++/Trees/tree/segment_tree.hpp
  class segment_tree (line 4) | class segment_tree{
    method _get_mid (line 12) | int _get_mid(int start, int end){
    method _construct (line 17) | int _construct(int *v, int start, int end, int current){
    method _update_value (line 34) | void _update_value(int start, int end, int i, int difference, int curr...
    method _get_sum (line 44) | int _get_sum(int start, int end, int q_start, int q_end, int current){
    method segment_tree (line 55) | segment_tree(int *v, int n){
    method update (line 72) | void update(int i, int new_val){
    method get_sum (line 82) | int get_sum(int start, int end){
    method get (line 87) | int get(int n){
    method print (line 90) | void print(){

FILE: Data Structures/C:C++/Trees/tree/tree.hpp
  type tree_node (line 5) | struct tree_node{
    method tree_node (line 10) | tree_node(T new_data) : data(new_data), left_child(NULL), right_child(...
    method insert_left (line 12) | void insert_left(T new_data){
    method insert_right (line 17) | void insert_right(T new_data){
  function get_length (line 24) | int get_length(tree_node<T> *top){

FILE: Data Structures/C:C++/Trees/tree/trie.cpp
  type no (line 6) | struct no{
    method no (line 11) | inline no(char k){
    method insert (line 16) | inline bool insert(const string s, ll i){
  function main (line 31) | main(){}

FILE: Data Structures/C:C++/queue/queue.hpp
  type queuemp (line 6) | struct queuemp{
    method queuemp (line 10) | queuemp() : size(0) {}
    method push (line 12) | void push(T new_data){
    method print (line 20) | void print(){
    method T (line 34) | T pop(){
    method T (line 55) | T peek(){
  function get_size (line 61) | int get_size(queuemp<T> *s){

FILE: Data Structures/Java/Stack/Stack.java
  class Stack (line 4) | public class Stack<E> {
    method Stack (line 9) | public Stack() {
    method Stack (line 15) | public Stack(int size) {
    method isEmpty (line 21) | @SuppressWarnings("unchecked")
    method peek (line 32) | @SuppressWarnings("unchecked")
    method size (line 37) | @SuppressWarnings("unchecked")
    method pop (line 53) | @SuppressWarnings("unchecked")
    method push (line 65) | public void push(E data) {

FILE: Data Structures/Python/Graphs/Graph.py
  class Graph (line 4) | class Graph(object):
    method __init__ (line 7) | def __init__(self, connections, directed=False):#undirected by default
    method add_connections (line 12) | def add_connections(self, connections):
    method add (line 18) | def add(self, node1, node2):
    method remove (line 25) | def remove(self, node):
    method is_connected (line 38) | def is_connected(self, node1, node2):
    method find_path (line 43) | def find_path(self, node1, node2, path=[]):
    method __str__ (line 58) | def __str__(self):

FILE: Data Structures/Python/Graphs/dfs.py
  class Graph (line 3) | class Graph:
    method __init__ (line 4) | def __init__(self):
    method addEdge (line 7) | def addEdge(self, node1, node2):
  function dfsHelper (line 11) | def dfsHelper(current, graph, visited, visitFunc):
  function dfs (line 23) | def dfs(current, graph, visitFunc):
  function visitPrint (line 27) | def visitPrint(i):

FILE: Data Structures/Python/Linked List/singly_linked_list.py
  class Node (line 1) | class Node(object):
    method __init__ (line 3) | def __init__(self, data, next):
  class SingleList (line 8) | class SingleList(object):
    method show (line 13) | def show(self):
    method append (line 21) | def append(self, data):
    method remove (line 29) | def remove(self, node_value):

FILE: Data Structures/Python/Queue/Queue.py
  class Queue (line 11) | class Queue:
    method __init__ (line 13) | def __init__(self):
    method isEmpty (line 16) | def isEmpty(self):
    method enqueue (line 19) | def enqueue(self, item):
    method dequeue (line 22) | def dequeue(self):
    method size (line 25) | def size(self):

FILE: Data Structures/Python/Stack/stack.py
  class Stack (line 3) | class Stack:
    method __init__ (line 4) | def __init__(self):
    method isEmpty (line 7) | def isEmpty(self):
    method push (line 10) | def push(self, item):
    method pop (line 13) | def pop(self):
    method peek (line 16) | def peek(self):
    method size (line 19) | def size(self):

FILE: Data Structures/Python/Trees/m-coloring-problem.py
  class Graph (line 1) | class Graph:
    method __init__ (line 2) | def __init__(self,m,v):
  function mColoring (line 6) | def mColoring(k,m,g,x):
  function getNodeColor (line 18) | def getNodeColor(k,m,g,x):
  function main (line 37) | def main():

FILE: Dynamic Programing/Dynamic_fibonacci.py
  function fibonacci (line 6) | def fibonacci(n):

FILE: Dynamic Programing/Edit Distance.Py
  function DP (line 3) | def DP(x,y,i,j):

FILE: Dynamic Programing/Knapsack.py
  function DP (line 5) | def DP(val,s,i,x):

FILE: Dynamic Programing/Memoized Cut Rod.Py
  function cut_rod (line 5) | def cut_rod(p,n):

FILE: Dynamic Programing/Word_Wrap.Py
  function badness (line 4) | def badness(i,j,m):
  function minimum (line 16) | def minimum(i,ls,w,n):
  function DP (line 23) | def DP(i,ls,w,n):

FILE: Dynamic Programing/longest_increasing_subsequence.cpp
  function longestIncreasingSubsequence (line 3) | int longestIncreasingSubsequence(int A[],int size){
  function main (line 20) | int main() {

FILE: Mathematical Challenges/C:C++/Fibonacci/Fibonacci Test.cpp
  function main (line 8) | int main()

FILE: Mathematical Challenges/C:C++/Square Root Decomposition/MO's Algorithm/MOAlgo.cpp
  function sbt (line 24) | inline int sbt(int x){return __builtin_popcount(x);}
  function f (line 29) | bool f(pair<int,pi> a, pair<int,pi> b){
  function main (line 34) | int main() {

FILE: Mathematical Challenges/C:C++/armstrong_number/C/armstrong.c
  function main (line 4) | int main(void)

FILE: Mathematical Challenges/C:C++/convexHull/ConvexHullScan.cpp
  function Is_Right_Turn (line 10) | bool Is_Right_Turn(vector <pair<int,int>> Hull){
  function main (line 31) | int main(){

FILE: Mathematical Challenges/C:C++/factorial/factorial.c
  function main (line 2) | int main(){

FILE: Mathematical Challenges/C:C++/fibbinacci/fibbinacci.c
  function main (line 3) | int main(){

FILE: Mathematical Challenges/C:C++/gcd/extended_gcd.cpp
  type Res_gcd (line 29) | struct Res_gcd{
    method Res_gcd (line 31) | Res_gcd(int gcd, int x, int y){
  function Res_gcd (line 43) | Res_gcd gcd_extended(int a,int b){
    method Res_gcd (line 31) | Res_gcd(int gcd, int x, int y){
  function main (line 51) | int main(){

FILE: Mathematical Challenges/C:C++/gcd/gcd.cpp
  function gcd (line 7) | int gcd(int a,int b){
  function main (line 13) | int main()

FILE: Mathematical Challenges/C:C++/gcd/mod_inverse.cpp
  type Res_gcd (line 29) | struct Res_gcd{
    method Res_gcd (line 31) | Res_gcd(int gcd, int x, int y){
  function Res_gcd (line 43) | Res_gcd gcd_extended(int a,int b){
    method Res_gcd (line 31) | Res_gcd(int gcd, int x, int y){
  function modd (line 56) | int modd(int num,int m){
  function mod_inverse (line 62) | int mod_inverse(int a,int m){
  function main (line 71) | int main(){

FILE: Mathematical Challenges/C:C++/largestoutof3/largestoutof3.c
  function main (line 2) | int main(){

FILE: Mathematical Challenges/C:C++/multiplication/multiply 2 numbers greater than 10^6.cpp
  function main (line 8) | int main()

FILE: Mathematical Challenges/C:C++/power/modular_exponention.cpp
  function ui (line 8) | ui modular_expo_no_rec(int base,int p){
  function ui (line 20) | ui modular_expo_rec(ui b,ui p){
  function main (line 31) | int main(){

FILE: Mathematical Challenges/C:C++/power/ques/summation.cpp
  function ui (line 8) | ui two_pow(int n){
  function ui (line 20) | ui modular_expo(ui b,ui p){
  function main (line 27) | int main(){

FILE: Mathematical Challenges/C:C++/power/two_pow.cpp
  function two_pow (line 29) | int two_pow(int p){
  function main (line 40) | int main(){

FILE: Mathematical Challenges/C:C++/powerset/PowerSet.java
  class PowerSet (line 2) | public class PowerSet {
    method powerSet (line 4) | public static <T> Set<Set<T>> powerSet( Set<T> set ) {
    method main (line 21) | public static void main(String[] args) {

FILE: Mathematical Challenges/C:C++/prime number tricks/List all primes.cpp
  function main (line 12) | int main()

FILE: Mathematical Challenges/C:C++/prime/prime.c
  function main (line 2) | int main(){

FILE: Mathematical Challenges/C:C++/prime/sieveOferatosthenes.cpp
  function sieve_of_eratosthenes (line 4) | void sieve_of_eratosthenes(std::vector<int>& primes, const int max) {
  function main (line 31) | int main() {

FILE: Mathematical Challenges/C:C++/ques/cpcrc1c.cpp
  function ui (line 10) | ui sum_of_digits(string str){
  function ui (line 17) | ui digit_sum(string str){
  function main (line 37) | int main(){

FILE: Mathematical Challenges/python/pernicious_prime/pernicious.py
  function isprime (line 20) | def isprime(num): #function to check whether a number is prime or not
  function count_ones (line 44) | def count_ones(num): #function to calculate the number of set bits in a ...

FILE: Mathematical Challenges/python/sieve_of_eratoshthenes.py
  function sieve (line 5) | def sieve():

FILE: Patterns/pattern10.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern11.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern12.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern13.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern14.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern15.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern16.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern8.cpp
  function main (line 4) | int main(){

FILE: Patterns/pattern9.cpp
  function main (line 4) | int main(){

FILE: STL C++/STACK_with_Application/Evaluating Postfix Expression.c
  function isoperator (line 5) | int isoperator(char c){
  type stack (line 9) | struct stack
  function push (line 15) | void push(double c){
  function pop (line 19) | double pop(){
  function perform (line 23) | double perform(double a, double b, char c){
  function post_infix (line 39) | void post_infix(char a[],int l){
  function main (line 58) | int main()

FILE: STL C++/STACK_with_Application/Infix to Postfix.c
  type temp (line 4) | struct temp{
  type temp (line 8) | struct temp
  function push (line 10) | void push(char item){
  function isempty (line 14) | int isempty(){
  function pop (line 18) | char pop(){
  function isoperator (line 22) | int isoperator(char c){
  function precedence (line 26) | int precedence(char c){
  function main (line 66) | int main(){

FILE: STL C++/STACK_with_Application/balance parenthesis.cpp
  function main (line 7) | int main(){

FILE: STL C++/STACK_with_Application/stack_and_its_implementation.c
  type stack (line 7) | struct stack{
  type stack (line 14) | struct stack
  function push (line 17) | void push(){
  function pop (line 33) | void pop(){
  function peep (line 42) | void peep(){
  function print (line 50) | void print(){
  function main (line 64) | int main(){

FILE: STL C++/sorting_a_vector.cpp
  function compare (line 7) | bool compare(int a,int b){
  function main (line 11) | int main(){

FILE: STL C++/stack/Stack.java
  class Stack (line 4) | public class Stack<E> {
    method Stack (line 9) | public Stack() {
    method Stack (line 15) | public Stack(int size) {
    method isEmpty (line 21) | @SuppressWarnings("unchecked")
    method peek (line 32) | @SuppressWarnings("unchecked")
    method size (line 37) | @SuppressWarnings("unchecked")
    method pop (line 53) | @SuppressWarnings("unchecked")
    method push (line 65) | public void push(E data) {

FILE: STL C++/stack/largestRectangleHistogram.cpp
  function main (line 5) | int main() {

FILE: STL C++/stack/stack.hpp
  type stackmp (line 6) | struct stackmp{
    method stackmp (line 11) | stackmp(int cap) : capacity(cap),size(0) {}
    method push (line 13) | void push(T new_data){
    method print (line 25) | void print(){
    method T (line 39) | T pop(){
    method T (line 50) | T peek(){
  function get_size (line 56) | int get_size(stackmp<T> *s){
  function get_capacity (line 61) | int get_capacity(stackmp<T> *s){

FILE: Searching Algorithms/Bogo_sort.cpp
  function main (line 12) | int main()
  function is_sorted (line 32) | int is_sorted(int *a, int n)
  function shuffle (line 45) | void shuffle(int *a, int n)
  function bogosort (line 58) | void bogosort(int *a, int n)

FILE: Searching Algorithms/C:C++/Binary_Search.cpp
  function main (line 4) | int main()

FILE: Searching Algorithms/C:C++/Binary_search.cpp
  function main (line 5) | void main()

FILE: Searching Algorithms/C:C++/Interpolation_search.cpp
  function interpolation_search (line 10) | long long int interpolation_search(int arr[],int n,int x)
  function main (line 37) | int main()

FILE: Searching Algorithms/C:C++/Jump_Search.cpp
  function jumpSearch (line 6) | int jumpSearch(int arr[], int x, int n)
  function main (line 41) | int main()

FILE: Searching Algorithms/C:C++/Liear_search.cpp
  function main (line 5) | void main()

FILE: Searching Algorithms/C:C++/MEDIAN_SEARCH.cpp
  function findMedian (line 26) | int findMedian(int arr[], int size_of_array)
  function partition (line 32) | int partition(int arr[], int low, int high, int variable_to_be_found)
  function kthSmallest (line 56) | int kthSmallest(int arr[], int low, int high, int k)
  function main (line 101) | int main()

FILE: Searching Algorithms/C:C++/Selection_sort.cpp
  function main (line 5) | void main()

FILE: Searching Algorithms/C:C++/Ternary_search.cpp
  function main (line 7) | int main()
  function ternary_search (line 31) | int ternary_search (int v[],int n, int left, int right, int x)

FILE: Searching Algorithms/C:C++/b_search.cpp
  function b_search (line 3) | int b_search(int a[],int l,int u,int s)
  function main (line 16) | int main()

FILE: Searching Algorithms/C:C++/fibonacci_search.cpp
  function _fibonacci_search (line 6) | int _fibonacci_search(int n, int arr[], int x)

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/binary_search.cpp
  function binarySearch (line 7) | int binarySearch(int array[], int left, int right, int search)
  function main (line 22) | int main()

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/binary_search_extras/position_in_sorted_array/eq_less_than.cpp
  function binary_search (line 9) | int binary_search(vector<int> &vec,int l,int r,int num,int best){
  function main (line 26) | int main(){

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/binary_search_extras/position_in_sorted_array/first_occurance.cpp
  function binary_search (line 9) | int binary_search(vector<int> &vec,int l,int r,int num,int best){
  function main (line 30) | int main(){

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/binary_search_extras/position_in_sorted_array/just_less_than_num.cpp
  function binary_search (line 9) | int binary_search(vector<int> &vec,int l,int r,int num,int best){
  function main (line 26) | int main(){

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/binary_search_extras/position_in_sorted_array/position_in_sorted_array.cpp
  function binary_search (line 8) | int binary_search(vector<int> &vec, int l, int r, int num){
  function main (line 23) | int main(){

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/binary_search_extras/ques/aggrcow.cpp
  function find (line 6) | int find(int l,int r){
  function main (line 28) | int main(){

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/jump_search.cpp
  function jumpSearch (line 8) | int jumpSearch(int array[], int search, int size)
  function main (line 33) | int main()

FILE: Searching Algorithms/C:C++/seaching algorithms [rename]/linear.cpp
  function main (line 6) | int main()

FILE: Searching Algorithms/C:C++/ternarySearch.cpp
  function ternarySearch (line 11) | int ternarySearch(int arr[],int l,int r, int x){
  function main (line 31) | int main(){

FILE: Searching Algorithms/C:C++/ternary_search.c
  function ternarySearch (line 6) | int ternarySearch(int arr[],int l,int r, int x){
  function main (line 27) | int main(){

FILE: Searching Algorithms/Java/algos/BinarySearch.java
  class BinarySearch (line 3) | public class BinarySearch{
    method binarySearch (line 4) | public static int binarySearch(int [] arr, int key, int low, int high) {

FILE: Searching Algorithms/Java/algos/LinearSearch.java
  class LinearSearch (line 3) | public class LinearSearch{
    method linearSearch (line 4) | public static int linearSearch(int [] arr, int key) {

FILE: Searching Algorithms/Java/driving.java
  class LinearSearch (line 3) | public class LinearSearch{
    method linearSearch (line 4) | public static int linearSearch(int [] arr, int key) {
    method main (line 14) | public static void main(String a[]) {

FILE: Searching Algorithms/Python/binarysearch.py
  function binary_search (line 1) | def binary_search(item_list,item):

FILE: Searching Algorithms/Python/bst.py
  class Node (line 6) | class Node:
    method __init__ (line 7) | def __init__(self,key):
  function insert (line 13) | def insert(root,node):
  function inorder (line 29) | def inorder(root):

FILE: Segment Trees/C++/RangeMinimumQuery.cpp
  function rmq (line 5) | int rmq(int *st, int n, int ss, int se, int qs, int qe, int si) {
  function buildTree (line 22) | int buildTree(int a[], int n, int ss, int se, int *st, int si) {
  function main (line 48) | int main()

FILE: Segment Trees/C++/SumInGivenRange.cpp
  function getSum (line 5) | int getSum(int *st, int n, int ss, int se, int qs, int qe, int si) {
  function UpdateUtil (line 22) | void UpdateUtil(int *st, int ss, int se, int i, int diff, int si) {
  function UpdateValue (line 37) | void UpdateValue(int a[], int *st, int n, int i, int new_value) {
  function buildTree (line 51) | int buildTree(int a[], int n, int ss, int se, int *st, int si) {
  function main (line 77) | int main()

FILE: Segment Trees/Java/SegementTree.java
  class SegmentTree (line 5) | public class SegmentTree {
    method main (line 10) | public static void main(String args[])
    method build (line 64) | public static void build(int node, int start, int end)
    method query (line 79) | public static int query(int node, int start, int end, int l, int r)
    method update (line 98) | public static void update(int node, int start, int end, int idx, int val)

FILE: Segment Trees/Java/SegementTreeLazyPropagation.java
  class LazySegmentTree (line 6) | class LazySegmentTree
    method updateRangeUtil (line 18) | void updateRangeUtil(int si, int ss, int se, int us,
    method updateRange (line 89) | void updateRange(int n, int us, int ue, int diff)  {
    method getSumUtil (line 104) | int getSumUtil(int ss, int se, int qs, int qe, int si)
    method getSum (line 153) | int getSum(int n, int qs, int qe)
    method constructSTUtil (line 168) | void constructSTUtil(int arr[], int ss, int se, int si)
    method constructST (line 195) | void constructST(int arr[], int n)
    method main (line 203) | public static void main(String args[])

FILE: Sorting Algorithms/C:C++/Counting_Sort.cpp
  function main (line 4) | int main()

FILE: Sorting Algorithms/C:C++/Insertion_sort.cpp
  function main (line 5) | void main()

FILE: Sorting Algorithms/C:C++/Merge_sort.cpp
  function Merge (line 6) | void Merge(int *a, int low, int high, int mid)
  function MergeSort (line 56) | void MergeSort(int *a, int low, int high)
  function main (line 71) | int main()

FILE: Sorting Algorithms/C:C++/QuickSort.c
  function swap (line 15) | void swap (int a[], int left, int right)
  function quicksort (line 23) | void quicksort( int a[], int low, int high )
  function partition (line 35) | int partition( int a[], int low, int high )
  function main (line 62) | int main()
  function printarray (line 79) | void printarray(int a[], int n)

FILE: Sorting Algorithms/C:C++/Quick_sort.cpp
  function main (line 76) | int main()
  function quick_sort (line 95) | void quick_sort(int a[],int l,int u)
  function partition (line 106) | int partition(int a[],int l,int u)

FILE: Sorting Algorithms/C:C++/Radix_sort.cpp
  class radixsort (line 5) | class radixsort{
  function main (line 61) | void main(){

FILE: Sorting Algorithms/C:C++/bubblesort.c
  function main (line 5) | int main(){

FILE: Sorting Algorithms/C:C++/bubblesort.cpp
  function main (line 5) | void main()

FILE: Sorting Algorithms/C:C++/bucketsort.c
  function bucketSort (line 5) | void bucketSort(int a[], int n) {
  function main (line 19) | int main() {

FILE: Sorting Algorithms/C:C++/heapSort.c
  function heapify (line 3) | int heapify(int* a, int i, int n)
  function buildheap (line 21) | int buildheap(int *a, int n)
  function sort (line 28) | int sort(int* a, int n)
  function main (line 44) | int main()

FILE: Sorting Algorithms/C:C++/insertion.hpp
  function insertion_sort (line 4) | void insertion_sort(int length, int v[]){

FILE: Sorting Algorithms/C:C++/merge.hpp
  function _merge (line 4) | void _merge(int v[], int left, int mid, int right){
  function _merge_sort (line 50) | void _merge_sort(int v[], int left, int right){
  function merge_sort (line 61) | void merge_sort(int length, int v[]){

FILE: Sorting Algorithms/C:C++/quick.hpp
  function _partition (line 4) | int _partition(int v[], int left, int right){
  function _quick (line 18) | void _quick(int v[], int left, int right){
  function quick_sort (line 26) | void quick_sort(int length, int v[]){

FILE: Sorting Algorithms/C:C++/quick_sort.c
  function quicksort (line 2) | void quicksort(int number[25],int first,int last){
  function main (line 31) | int main(){

FILE: Sorting Algorithms/C:C++/radix.hpp
  function _count_sort (line 4) | void _count_sort(int arr[], int length, int exp){
  function radix_sort (line 26) | void radix_sort(int length, int v[]){

FILE: Sorting Algorithms/C:C++/selectionsort.c
  function swap (line 11) | void swap(int *xp, int *yp)
  function selectionSort (line 18) | void selectionSort(int arr[], int n)
  function printArray (line 37) | void printArray(int arr[], int size)
  function main (line 46) | int main()

FILE: Sorting Algorithms/C:C++/shell_sort.h
  function namespace (line 4) | namespace alg {

FILE: Sorting Algorithms/C:C++/slow.cpp
  function _slow_sort (line 4) | void _slow_sort(int v[], int i, int j) {
  function slow_sort (line 14) | void slow_sort(int length, int v[]) {

FILE: Sorting Algorithms/C:C++/sorting_a_vector.cpp
  function compare (line 7) | bool compare(int a,int b){
  function main (line 11) | int main(){

FILE: Sorting Algorithms/Java/Countsort.java
  class CountingSort (line 1) | public class CountingSort
    method sort (line 3) | public static void sort(char arr[])
    method main (line 38) | public static void main(String args[])

FILE: Sorting Algorithms/Java/HeapSort.java
  class HeapSort (line 5) | public class HeapSort {
    method main (line 7) | public static void main(String[] args) {
    method sort (line 15) | public static void sort(int[] a) {
    method heapify (line 33) | public static void heapify(int arr[], int n, int i)

FILE: Sorting Algorithms/Java/MergeSort.java
  class test (line 3) | public class test {
    method main (line 5) | public static void main(String[] args) {
    method mergeSort (line 17) | public static void mergeSort(String[] a, int low, int high) {
    method merge (line 27) | public static void merge(String[] a, int low, int mid, int high) {

FILE: Sorting Algorithms/Python/QuickSort.py
  function partition (line 1) | def partition(arr,low,high):
  function quickSort (line 24) | def quickSort(arr,low,high):

FILE: Sorting Algorithms/Python/bogosort.py
  function bogosort (line 7) | def bogosort(my_array):

FILE: Sorting Algorithms/Python/bubblesort.py
  function bubble_sort (line 1) | def bubble_sort(arr):

FILE: Sorting Algorithms/Python/cocktailsort.py
  function cocktailsort (line 6) | def cocktailsort(a):

FILE: Sorting Algorithms/Python/insertionsort.py
  function insertion_sort (line 1) | def insertion_sort(my_array):

FILE: Sorting Algorithms/Python/mergesort.py
  function mergeSort (line 1) | def mergeSort(nlist):

FILE: Sorting Algorithms/Python/quicksort.py
  function quickSort (line 1) | def quickSort(data_list):
  function quickSortHlp (line 4) | def quickSortHlp(data_list,first,last):
  function partition (line 13) | def partition(data_list,first,last):

FILE: Sorting Algorithms/Python/topological_sort.py
  class Graph (line 5) | class Graph:
    method __init__ (line 6) | def __init__(self,vertices):
    method addEdge (line 11) | def addEdge(self,u,v):
    method topologicalSortUtil (line 15) | def topologicalSortUtil(self,v,visited,stack):
    method topologicalSort (line 30) | def topologicalSort(self):

FILE: Sorting Algorithms/sleep sort.c
  function routine (line 5) | void routine(void *a)

FILE: String Manipulation/C:C++/String_algo/KMP.cpp
  function preprocess (line 24) | void preprocess(string a)
  function kmp (line 40) | void kmp(string a,string t)
  function main (line 58) | int main()

FILE: String Manipulation/C:C++/String_algo/SUFFIX-ARRAY.cpp
  type mytuple (line 22) | struct mytuple{
  function cmp (line 27) | bool cmp(mytuple a,mytuple b)
  function main (line 33) | int main()

FILE: String Manipulation/C:C++/String_algo/z_algorithm.cpp
  function ll (line 21) | ll modexp(ll a,ll b){ ll res = 1; while(b > 0){  if(b & 1) res = (res * ...
  function readLI (line 23) | long long readLI(){  register char c;  for(c = getchar(); !(c>='0' && c<...
  function z_function (line 31) | void z_function(string s)
  function main (line 42) | int main()

FILE: String Manipulation/C:C++/tokens/token_break.cpp
  function main (line 6) | int main ()

FILE: String Manipulation/C:C++/tokens/word_break.cpp
  function dictionaryContains (line 7) | int dictionaryContains(string &word)
  function wordBreak (line 23) | void wordBreak(string str)
  function wordBreakUtil (line 30) | void wordBreakUtil(string str, int n, string result)
  function main (line 58) | int main()

FILE: String Manipulation/Python/LCS.py
  function lcs (line 1) | def lcs(a, b):

FILE: backtrack/sudoku/code2.cpp
  function check_possibility (line 8) | bool check_possibility(matrix& vec,int num,int row,int col){
  function isGood (line 27) | bool isGood(matrix& vec,int num,int row,int col){
  function back_track (line 39) | bool back_track(matrix& vec,int row,int col){
  function main (line 72) | int main(){

FILE: backtrack/sudoku/sudoku.cpp
  function check_possibility (line 7) | bool check_possibility(matrix& vec,int num,int row,int col){
  function isGood (line 26) | bool isGood(matrix& vec,int num,int row,int col){
  function back_track (line 38) | bool back_track(matrix& vec,int row,int col){
  function main (line 71) | int main(){

FILE: binary_tree/binarytree.java
  class Node (line 1) | class Node{
    method Node (line 5) | public Node(int data){
    method Node (line 164) | public Node(int data){
  class BinarySearchTree (line 10) | public class BinarySearchTree {
    method BinarySearchTree (line 12) | public BinarySearchTree(){
    method find (line 16) | public boolean find(int id){
    method delete (line 29) | public boolean delete(int id){
    method getSuccessor (line 92) | public Node getSuccessor(Node deleleNode){
    method insert (line 110) | public void insert(int id){
    method display (line 135) | public void display(Node root){
    method main (line 142) | public static void main(String arg[]){
  class Node (line 160) | class Node{
    method Node (line 5) | public Node(int data){
    method Node (line 164) | public Node(int data){

FILE: btree.cpp
  type alg (line 21) | namespace alg {
    class BTree (line 22) | class BTree {
      type node_t (line 26) | struct node_t {
      type node_t (line 34) | struct node_t
      type Res (line 38) | struct Res {
      method BTree (line 48) | BTree(const char * path) {
      method Res (line 64) | Res Search(int32_t x) {
      method Insert (line 69) | void Insert(int32_t k) {
      method DeleteKey (line 89) | void DeleteKey(int32_t k) {
      method Res (line 98) | Res search(node x, int32_t k) {
      method insert_nonfull (line 120) | void insert_nonfull(node x, int32_t k) {
      method split_child (line 153) | void split_child(node x, int32_t i) {
      method delete_op (line 191) | void delete_op(node x, int32_t k) {
      method case1 (line 229) | void case1(node x, int32_t i, int32_t k) {
      method case2 (line 238) | void case2(node x, int32_t i, int32_t k) {
      method case3 (line 313) | void case3(node x, int32_t i, int32_t k) {
      method delete_i (line 454) | void delete_i(node x, int32_t i)  {
      method node (line 486) | node ROOT() {
      method node (line 496) | node READ(node x, int32_t i) {
      method WRITE (line 508) | void WRITE(node x) {

FILE: cryptography/Python/porta.py
  class Porta (line 4) | class Porta(Cipher):
    method __init__ (line 9) | def __init__(self,key='FORTIFICATION'):
    method encipher (line 12) | def encipher(self,string):
    method decipher (line 39) | def decipher(self,string):

FILE: cryptography/des/java/Converter.java
  class Converter (line 9) | public class Converter {
    method convertToBinaryCode (line 11) | public static String convertToBinaryCode(String text) {
    method getBytes (line 36) | private static byte[] getBytes (String text) {

FILE: cryptography/des/java/DES.java
  class DES (line 3) | public class DES {
    method getKey (line 11) | public String getKey() {
    method setKey (line 15) | public void setKey(String key) {
    method getMessage (line 19) | public String getMessage() {
    method setMessage (line 23) | public void setMessage(String message) {
    method encrypt (line 27) | public String encrypt() {
    method messagePermutation (line 84) | private String messagePermutation(String input) {
    method generateKeys (line 99) | private void generateKeys(String key) {
    method beginKeyPermutation (line 112) | private String beginKeyPermutation(String input) {
    method leftShiftBits (line 127) | private String leftShiftBits(String input, int step) {
    method finishKeyPermutation (line 138) | private String finishKeyPermutation(String input) {
    method E (line 151) | private String E(String input) {
    method xor (line 170) | private static String xor(String x1, String x2) {
    method sBox (line 196) | private String sBox(int boxNumber, String b) {
    method cPermute (line 265) | private String cPermute(String input) {
    method lastInverse (line 280) | private String lastInverse(String input) {

FILE: cryptography/des/java/IO.java
  class IO (line 5) | public class IO {
    method IO (line 11) | public IO(String inputFilePath, String outputFilePath) {
    method readMessageFromFile (line 16) | public String readMessageFromFile() {
    method readKeyFromFile (line 26) | public String readKeyFromFile() {
    method writeStringInFile (line 37) | public void writeStringInFile(String text) {

FILE: cryptography/des/java/Main.java
  class Main (line 7) | public class Main {
    method main (line 9) | public static void main(String[] args) {

FILE: dfs.cpp
  function main (line 6) | void main()
  function DFS (line 27) | void DFS(int i)

FILE: disjoint_set/disjoint_set.hpp
  class disjoint_set (line 4) | class disjoint_set {
    method disjoint_set (line 8) | disjoint_set(int n) : id(new int[n]), size(new int[n]), count(n) {
    method get_count (line 21) | int get_count(){
    method find (line 26) | int find(int n){
    method merge (line 37) | void merge(int x, int y){
    method connected (line 54) | bool connected(int x, int y){

FILE: divide_and_conquer/maximum_sub_array.cpp
  function main (line 23) | int main(){

FILE: divide_and_conquer/strassen.cpp
  function main (line 17) | int main() {
  function Add (line 64) | void Add(int **A, int **B, int **T, int n) {
  function Sub (line 73) | void Sub(int **A, int **B, int **T, int n) {
  function createMatrix (line 83) | void createMatrix(int **A,int size) {
  function output (line 92) | void output(int **A, int size) {
  function standardMult (line 103) | void standardMult(int **A, int **B, int **C, int size) {
  function strassens (line 115) | void strassens(int **A, int **B, int **C, int size) {

FILE: dp/0-1knapsack.cpp
  function knapsack (line 4) | int knapsack(int n, int w, int weight[], int val[])
  function main (line 25) | int main() {

FILE: dp/Digit_dp.cpp
  function getDigits (line 6) | long long int getDigits(long long int x, vector <int> &digits) {
  function digitSum (line 13) | long long int digitSum(int idx, int sum, int tight, vector <int> &digit) {
  function rangeDigitSum (line 40) | long long int rangeDigitSum(int a, int b) {
  function main (line 58) | int main()

FILE: dp/coinchange.cpp
  function coinWaysTD (line 7) | int coinWaysTD(int amt,int coins[],int n){
  function coinWaysBU (line 29) | int coinWaysBU(int amt,int coins[],int n){
  function main (line 44) | int main(){

FILE: dp/editDistance.cpp
  function min (line 8) | inline int min(int a,int b,int c){
  function editDistance (line 14) | int editDistance(string a,string b,int m,int n){
  function main (line 28) | int main(){

FILE: dp/eggdropping.cpp
  function eggdrop (line 4) | int eggdrop(int n, int k)
  function main (line 32) | int main() {

FILE: dp/kadane.cpp
  function main (line 4) | int main() {

FILE: dp/lcs.cpp
  function lcs (line 5) | int lcs(string s1,string s2,int i,int j){
  function lcsMatrix (line 16) | int lcsMatrix(string s1,string s2) {
  function main (line 61) | int main(){

FILE: dp/lis.cpp
  function main (line 4) | int main() {

FILE: dp/mcm.cpp
  function mcmdnc (line 13) | int mcmdnc(int a,int b)
  function mcmdp (line 34) | int mcmdp(int p[], int n){
  function main (line 52) | int main(){

FILE: genome_sort.py
  function gnomeSort (line 1) | def gnomeSort( arr, n):

FILE: graph/bfs_dfs/bfs/BFS.cpp
  class Graph (line 9) | class Graph
  function main (line 74) | int main()

FILE: graph/bfs_dfs/bfs/BFS.py
  class Graph (line 6) | class Graph:
    method __init__ (line 9) | def __init__(self):
    method addEdge (line 15) | def addEdge(self,u,v):
    method BFS (line 20) | def BFS(self, s):

FILE: graph/bfs_dfs/bfs/bfs.cpp
  function bfs (line 5) | void bfs(int n, std::vector<int> v[], int s){
  function main (line 27) | int main(){

FILE: graph/bfs_dfs/dfs/DFS.cpp
  function dfs (line 28) | void dfs(int u) {
  function printTree (line 53) | void printTree(int V) {
  function main (line 68) | int main() {

FILE: graph/bfs_dfs/dfs/DFS.java
  class DFS (line 32) | public class DFS {
    method main (line 44) | public static void main(String[] args) {
    method readMatrixFromFile (line 51) | private static int[][] readMatrixFromFile() {
    method dfs (line 77) | private static String dfs(int[][] matrix, int v) {
    method printSolution (line 91) | private static void printSolution(String answer) {

FILE: heap/heap.hpp
  class heap (line 5) | class heap {
    method heap (line 12) | heap() : arr(NULL), size(0), capacity(0), type(0) {}
    method heap (line 13) | heap(int capacity, int type) : arr(new T[capacity]), size(0), capacity...
    method get_size (line 16) | int get_size(){ return this->size; }
    method get_capacity (line 17) | int get_capacity(){ return this->capacity; }
    method get_type (line 18) | int get_type(){ return this->type; }
    method get_parent (line 22) | int get_parent(int child_index){
    method has_left_child (line 27) | bool has_left_child(int parent_index){
    method has_right_child (line 31) | bool has_right_child(int parent_index){
    method get_left_child (line 36) | int get_left_child(int parent_index){
    method get_right_child (line 43) | int get_right_child(int parent_index){
    method T (line 51) | T get_min(){
    method T (line 57) | T get_max(){
    method down (line 65) | void down(int parent_index){
    method is_full (line 93) | bool is_full(){
    method is_empty (line 97) | bool is_empty(){
    method resize (line 101) | void resize(){
    method insert (line 113) | void insert(T data){
    method heap (line 125) | heap(T ar[], int capacity, int type) : arr(new T[capacity]), size(capa...
    method print (line 130) | void print(){
    method is_heap (line 136) | bool is_heap(){

FILE: heap/min_heap.cpp
  class minHeap (line 5) | class minHeap{
    method heapify (line 8) | void heapify(int i){
    method minHeap (line 25) | minHeap(){
    method push (line 28) | void push(int data){
    method getmin (line 40) | int getmin(){
    method pop (line 43) | void pop(){
    method isEmpty (line 50) | bool isEmpty(){
  function main (line 55) | int main(){

FILE: os/scheduling/fcfs.cpp
  function findWaitingTime (line 8) | void findWaitingTime(int processes[], int n,
  function findTurnAroundTime (line 20) | void findTurnAroundTime( int processes[], int n,
  function findavgTime (line 30) | void findavgTime( int processes[], int n, int bt[])
  function main (line 61) | int main()

FILE: os/scheduling/os_priority.cpp
  type Process (line 6) | struct Process
  function comparison (line 14) | bool comparison(Process a, Process b)
  function findWaitingTime (line 21) | void findWaitingTime(Process proc[], int n,
  function findTurnAroundTime (line 33) | void findTurnAroundTime( Process proc[], int n,
  function findavgTime (line 43) | void findavgTime(Process proc[], int n)
  function priorityScheduling (line 74) | void priorityScheduling(Process proc[], int n)
  function main (line 87) | int main()

FILE: os/scheduling/os_roundrobin.cpp
  function findWaitingTime (line 6) | void findWaitingTime(int processes[], int n,
  function findTurnAroundTime (line 69) | void findTurnAroundTime(int processes[], int n,
  function findavgTime (line 79) | void findavgTime(int processes[], int n, int bt[],
  function main (line 111) | int main()

FILE: os/scheduling/os_sjf.cpp
  type Process (line 5) | struct Process
  function comparison (line 14) | bool comparison(Process a, Process b)
  function findWaitingTime (line 21) | void findWaitingTime(Process proc[], int n, int wt[])
  function findTurnAroundTime (line 32) | void findTurnAroundTime(Process proc[], int n,
  function findavgTime (line 42) | void findavgTime(Process proc[], int n)
  function main (line 74) | int main()

FILE: os/scheduling/os_srtf.cpp
  type Process (line 6) | struct Process {
  function findWaitingTime (line 14) | void findWaitingTime(Process proc[], int n,
  function findTurnAroundTime (line 82) | void findTurnAroundTime(Process proc[], int n,
  function findavgTime (line 92) | void findavgTime(Process proc[], int n)
  function main (line 129) | int main()

FILE: shellsort.c
  function shellsort (line 3) | void shellsort(int arr[], int num)
  function main (line 31) | int main()

FILE: sieve_of_eratoshthenes.cpp
  function sieve (line 6) | void sieve() {