SYMBOL INDEX (4063 symbols across 1038 files) FILE: Algorithms/Array/Arr4 right shift.c function AcceptArray (line 7) | void AcceptArray(int *Arr1 , int n) function DisplayArray (line 24) | void DisplayArray(int *Arr1[],int n ) function main (line 41) | void main(void) FILE: Algorithms/Array/InsertArray.c function main (line 4) | int main() FILE: Algorithms/Array/LinearSearch.java class Main (line 2) | public class Main { FILE: Algorithms/Array/Merge-Sorted-Array.c function cmpfunc (line 3) | int cmpfunc (const void * a, const void * b) { function main (line 7) | int main() FILE: Algorithms/Array/Merge-Sorted-Array.cpp function printArray (line 6) | void printArray(int arr[], int size) function mergeKArrays (line 12) | void mergeKArrays(int arr[][n], int a, int output[]) function main (line 27) | int main() FILE: Algorithms/Array/Merge-Sorted-Array.js function mergeSorted (line 3) | function mergeSorted(a, b) { FILE: Algorithms/Array/Merge-Sorted-Array.py function mergeK (line 3) | def mergeK(arr, k): function printArray (line 9) | def printArray(arr): FILE: Algorithms/Array/Merge_Sorted_Arrays.rb function merge_sorted_arrays (line 1) | def merge_sorted_arrays(arrays) function sort (line 13) | def sort(num_arr) function merge (line 23) | def merge(left, right) FILE: Algorithms/Array/Rearrange-High-Low.js function swap (line 1) | function swap(arr, i, j) function rearrangeArray (line 10) | function rearrangeArray(arr, n) FILE: Algorithms/Array/Remove-Dublicate.js function RemoveDuplicateItem (line 3) | function RemoveDuplicateItem(arr) { FILE: Algorithms/Array/Remove-Duplicates-from-Sorted-Array.c function ll (line 24) | ll max(ll i,ll j){ function removeDuplicates (line 29) | int removeDuplicates(vector& nums) { function main (line 47) | int main(){ FILE: Algorithms/Array/Remove-Duplicates-from-Sorted-Array.cpp function removeDuplicates (line 9) | int removeDuplicates(int arr[], int n) function main (line 31) | int main() FILE: Algorithms/Array/Shuffle.c function ll (line 24) | ll max(ll i,ll j){ function main (line 29) | int main(){ FILE: Algorithms/Array/Two-Arrays-And-Swaps.c function main (line 26) | int main(){ FILE: Algorithms/Array/check_two_equal_array.cpp function main (line 7) | int main() FILE: Algorithms/Array/copyarray.c function main (line 2) | int main() FILE: Algorithms/Array/counting_frequency_of_char_in_string.c function main (line 2) | int main() { FILE: Algorithms/Array/findpos.py function findposition (line 1) | def findposition(arr, x) : FILE: Algorithms/Array/high-low-rearrangement.c function swap (line 3) | void swap(int arr[], int i, int j) function rearrange (line 10) | void rearrange(int arr[], int n) function main (line 23) | int main(void) FILE: Algorithms/Array/high-low-rearrangement.py function swap (line 2) | def swap(A, i, j): function rearrangeArray (line 7) | def rearrangeArray(A): FILE: Algorithms/Array/largest-smallest-number-and-sum-of-all-elements-in-array.java class t17question7 (line 2) | class t17question7 method main (line 4) | public static void main(String args[])throws IOException FILE: Algorithms/Array/merge-sorted-arrays-algo-only.py function mergeSortedArrays (line 3) | def mergeSortedArrays(arrays): function getMinValue (line 23) | def getMinValue(items): FILE: Algorithms/Array/merge_without_extraspace.cpp function main (line 12) | int main() FILE: Algorithms/Array/merging_2_arrays.c function main (line 2) | int main() FILE: Algorithms/Array/rearrange-high-low.java class Main (line 2) | class Main method swap (line 5) | private static void swap(int[] A, int i, int j) method rearrangeArray (line 13) | public static void rearrangeArray(int[] A) method main (line 25) | public static void main (String[] args) FILE: Algorithms/Array/revering_array.c type Array (line 3) | struct Array function Display (line 9) | void Display(struct Array arr) function swap (line 16) | void swap(int *x,int *y) function Reverse (line 22) | void Reverse(struct Array *arr) function Reverse2 (line 32) | void Reverse2(struct Array *arr) function main (line 40) | int main() FILE: Algorithms/Array/rotate_matrix_90degree.cpp function main (line 13) | int main() FILE: Algorithms/Array/rotated_sorted_array_search.cpp function rotatedSearch (line 4) | int rotatedSearch(vector &A, int B) { FILE: Algorithms/Array/twoSum.cpp function findTwoSumNaive (line 7) | pair findTwoSumNaive(vector nums, int target){ function findTwoSumBetter (line 26) | pair findTwoSumBetter(vector nums, int target){ function findTwoSumOptimal (line 46) | pair findTwoSumOptimal(vector nums, int target){ function main (line 55) | int main(){ FILE: Algorithms/Backtracking/Crossword/Crossword.cpp function findString (line 17) | bool findString(vector &visited, int &index) function isPossible_col (line 30) | bool isPossible_col(vector> &grid, int row, int col, string... function isPossible_row (line 44) | bool isPossible_row(vector> &grid, int row, int col, string... function crossword (line 58) | bool crossword(vector> &grid, vector &visited, vector... function main (line 100) | int main() FILE: Algorithms/Backtracking/Nqueen/N_Queen.java class N_Queen (line 2) | public class N_Queen { method solveNQUtil (line 4) | public boolean solveNQUtil(int board[][],int col) { method isSafe (line 18) | boolean isSafe(int board[][],int row,int col) { method solveNQ (line 31) | boolean solveNQ() { method printsolution (line 47) | void printsolution(int board[][]) { method main (line 54) | public static void main(String[] args) { FILE: Algorithms/Backtracking/Nqueen/Nqueens.c function printmatrix (line 7) | void printmatrix() { function getmarkedcol (line 18) | int getmarkedcol(int row) { function feasible (line 27) | int feasible(int row, int col) { function nqueen (line 37) | void nqueen(int row) { function main (line 53) | int main() { FILE: Algorithms/Backtracking/Nqueen/Nqueens.cpp function isvalid (line 5) | bool isvalid(int board[][10],int i,int j,int n) function showNqueen (line 38) | bool showNqueen(int board[][10],int i,int n) function main (line 74) | int main() FILE: Algorithms/Backtracking/Nqueen/Nqueens_optimized.cpp function solve (line 8) | void solve(int i,int n) function main (line 29) | int main() FILE: Algorithms/Backtracking/Nqueen/nqueen.cpp function print (line 6) | void print(int n) { function isSafe (line 18) | bool isSafe(int col, int row, int n) { function solve (line 37) | bool solve (int n, int row) { function main (line 52) | int main() FILE: Algorithms/Backtracking/Nqueen/nqueens.py function printSolution (line 4) | def printSolution(board): function isSafe (line 10) | def isSafe(board, row, col): function solveNQUtil (line 29) | def solveNQUtil(board, col): function solveNQ (line 44) | def solveNQ(): FILE: Algorithms/Backtracking/Permutation/Permutations.c function swap (line 5) | void swap(int *ar, int i, int j) function printar (line 12) | void printar(int *ar, int n) function permute (line 20) | void permute(int *ar, int i, int n) function main (line 39) | int main() FILE: Algorithms/Backtracking/Permutation/permutation.py function permutation (line 1) | def permutation(arr): FILE: Algorithms/Backtracking/Permutation/permutations.cpp function solve (line 3) | void solve(vector& nums, vector& curr, vector> &re... function permute (line 19) | vector> permute(vector& nums) { function main (line 25) | int main() { FILE: Algorithms/Backtracking/Permutation/permutations.js function print (line 4) | function print(list,length){ function permutation (line 12) | function permutation(list,size,length){ FILE: Algorithms/Backtracking/Rat-In-A-Maze/Rat-In-A-Maze.cpp function rat_in_a_maze (line 7) | void rat_in_a_maze(int i, int j, int n, vector> &grid, vecto... function main (line 65) | int main() FILE: Algorithms/Cryptography/AES_Cipher/AES_Cipher.py function GetKey (line 15) | def GetKey(): function AES_Encryption (line 27) | def AES_Encryption(cleartext): function AES_Decryption (line 39) | def AES_Decryption(ciphertext): FILE: Algorithms/Cryptography/Affine_Cipher/Affine_Cipher.cpp function string (line 30) | string encryptMessage(string text, int (*func)(int)=NULL) function string (line 82) | string decryptMessage(string text, int (*func)(int)=NULL) function main (line 135) | int main(void) FILE: Algorithms/Cryptography/Affine_Cipher/Affine_Cipher.py function encryptMessage (line 29) | def encryptMessage(text, func = lambda x: a*x + b): function decryptMessage (line 73) | def decryptMessage(text, func = lambda x: inv_a*(x - b)): function main (line 103) | def main(): FILE: Algorithms/Cryptography/Affine_Cipher/affine_cipher.c function CalcGCD (line 10) | int CalcGCD(int alpha) function main (line 25) | int main() FILE: Algorithms/Cryptography/Bifid_Cipher/Bifid_Cipher.py function find_pos (line 39) | def find_pos(polybius_square, character): function get_word (line 55) | def get_word(a, b, polybius_square): function create_polybius_square (line 62) | def create_polybius_square(): function bifid_encryption (line 97) | def bifid_encryption(polybius_square, text): function decryption (line 121) | def decryption(polybius_square, encrypted_text): function main (line 139) | def main(): FILE: Algorithms/Cryptography/Caesar_Cipher/Caesar Cypher.cpp function main (line 4) | int main() { FILE: Algorithms/Cryptography/Caesar_Cipher/Caesar Cypher.py function encrypt (line 1) | def encrypt(text,s): FILE: Algorithms/Cryptography/Caesar_Cipher/CaesarCipher.java class CaesarCipher (line 3) | public class CaesarCipher { method shiftChar (line 6) | public static int shiftChar(int c, int shift) { method cipher (line 18) | public static String cipher(String str, int shift) { method cipher (line 25) | public static String cipher(String str) { method decipher (line 29) | public static String decipher(String str, int shift) { method decipher (line 33) | public static String decipher(String str) { method main (line 37) | public static void main(String [] args) { FILE: Algorithms/Cryptography/Caesar_Cipher/Caesar_Cipher.c function main (line 3) | int main() { FILE: Algorithms/Cryptography/Caesar_Cipher/Caesar_Cipher.cs class Program (line 3) | class Program method CaesarCipher (line 9) | private static string CaesarCipher(string text, int shiftAmount) method Encrypt (line 30) | private static string Encrypt(string text, int shiftAmount) method Decrypt (line 38) | private static string Decrypt(string text, int shiftAmount) method Main (line 46) | static void Main() method ExitAfterInvalidInput (line 80) | private static void ExitAfterInvalidInput() FILE: Algorithms/Cryptography/Caesar_Cipher/Caesar_Cipher.php function cipher (line 2) | function cipher(string $str, int $key) FILE: Algorithms/Cryptography/Caesar_Cipher/Caesar_Cypher.rb class CaesarCipher (line 1) | class CaesarCipher method encrypt (line 4) | def encrypt(sentence, times = 3) method rotate (line 14) | def rotate(times,current_char, index) FILE: Algorithms/Cryptography/RSA_Cipher/RSA_Cipher.py function modInverse (line 15) | def modInverse(e, phin) : FILE: Algorithms/Cryptography/RSA_Cipher/RSA_cipher.cpp function log_power (line 11) | int log_power(int n, int p, int mod) function new_func (line 23) | bool new_func(int n) function generate_prime (line 36) | int generate_prime() function gcd (line 44) | int gcd(int a, int b) function generate_coprime (line 55) | int generate_coprime(int n) function euclid_extended (line 63) | pair euclid_extended(int a, int b) { function modular_inverse (line 72) | int modular_inverse(int n, int mod) type Keys (line 83) | struct Keys function Keys (line 89) | Keys generate_keys() function encrypt (line 111) | int encrypt(PublicKey key, int value) function decrypt (line 116) | int decrypt(PrivateKey key, int value) function main (line 121) | int main() FILE: Algorithms/Cryptography/RSA_Cipher/RSA_cipher.java class Algorithm (line 11) | class Algorithm method Algorithm (line 22) | public Algorithm() method Algorithm (line 48) | public Algorithm(BigInteger e, BigInteger d, BigInteger N) method encryptMessage (line 59) | public byte[] encryptMessage(byte[] data) method decryptMessage (line 66) | public byte[] decryptMessage(byte[] data) class RSA_cipher (line 76) | public class RSA_cipher { method byte2String (line 78) | private static String byte2String(byte[] cipher) method main (line 88) | public static void main (String [] arguments) throws IOException FILE: Algorithms/Cryptography/Shamir_Cipher/Shamir_Cipher.c function mod_expo (line 13) | int mod_expo(int base, int exp, int mod) function free_heap_mem (line 30) | void free_heap_mem(char **shares, int n) function modInverse (line 68) | int modInverse(int k) function join_shares (line 175) | int join_shares(int *xy_pairs, int n) function main (line 295) | int main(void) FILE: Algorithms/Cryptography/Shamir_Cipher/Shamir_Cipher.cpp function calculate_Y (line 4) | int calculate_Y(int x, vector &poly) function secret_sharing (line 16) | void secret_sharing(int S, vector> &points, type fraction (line 37) | struct fraction method fraction (line 40) | fraction(int n, int d) method reduce_fraction (line 45) | void reduce_fraction(fraction &f) method fraction (line 51) | fraction operator*(fraction f) method fraction (line 58) | fraction operator+(fraction f) function Generate_Secret (line 66) | int Generate_Secret(int x[], int y[], int M) function solve (line 86) | void solve(int S, int N, int K) function main (line 108) | int main() FILE: Algorithms/Cryptography/Vernam_Cipher/Vernam_Cipher.cpp function apply_vernam (line 10) | void apply_vernam(void *data, void const * key, const size_t size) function generate_key (line 44) | void generate_key(void *key, const size_t size) function main (line 80) | int main() FILE: Algorithms/Cryptography/Vernam_Cipher/Vernam_Cipher.py function vernam_enc (line 5) | def vernam_enc(msg): function main (line 65) | def main(): FILE: Algorithms/Cryptography/Vigenere_Cipher/Vigenere_Cipher.cpp function positive_modulo (line 11) | unsigned positive_modulo(const int x, const int div) function is_letter (line 21) | bool is_letter(const unsigned char ch) function encrypt_vigenere (line 36) | std::string encrypt_vigenere(const std::string &plaintext, const std::st... function decrypt_vigenere (line 62) | std::string decrypt_vigenere(const std::string &ciphertext, const std::s... function main (line 89) | int main() FILE: Algorithms/Cryptography/Vigenere_Cipher/Vigenere_Cipher.py function create_key (line 3) | def create_key(msg, key): function encrypt (line 12) | def encrypt(msg, key): function decrypt (line 23) | def decrypt(msg, key): FILE: Algorithms/Cryptography/Vigenere_Cipher/Vignere_Cipher.cs class Program (line 5) | public class Program method wrap (line 10) | static int wrap(int k, int n) method VignereCipher (line 16) | static string VignereCipher(string plaintext, string key) method VignereDecipher (line 39) | static string VignereDecipher(string ciphertext, string key) method Main (line 63) | public static void Main(string[] args) FILE: Algorithms/Cryptography/Vigenere_Cipher/vigenereCipher.py function vignereCipher (line 1) | def vignereCipher(plain_text, key): function decryptVignereCipher (line 14) | def decryptVignereCipher(cipher_text, key): FILE: Algorithms/DP/0-1_Knapsack_Problem/0-1 Knapsack Problem.java class Knapsack (line 3) | public class Knapsack { method max (line 6) | static int max(int a, int b) method knapSack (line 12) | static int knapSack(int W, int wt[], int val[], int n) method main (line 35) | public static void main(String args[]) FILE: Algorithms/DP/0-1_Knapsack_Problem/Branch_And_Bound/0-1_knapsack.cpp type Item (line 8) | struct Item type Node (line 16) | struct Node function cmp (line 30) | bool cmp(Item a, Item b) function bound (line 40) | int bound(Node u, int n, int W, Item arr[]) function knapsack (line 74) | int knapsack(int W, Item arr[], int n) function main (line 146) | int main() FILE: Algorithms/DP/0-1_Knapsack_Problem/knapsackProblem.java class knapsackProblem (line 3) | public class knapsackProblem { method max (line 6) | static int max(int a, int b) method knapSack (line 12) | static int knapSack(int W, int wt[], int val[], int n) method main (line 35) | public static void main(String args[]) FILE: Algorithms/DP/0-1_Knapsack_Problem/knapsack_problem_0_1.cpp function max (line 3) | int max(int x, int y) function knapSack (line 7) | int knapSack(int W, int w[], int v[], int n) function main (line 25) | int main() FILE: Algorithms/DP/0-1_Knapsack_Problem/knapsack_problem_0_1.py function knapsack (line 4) | def knapsack(val, wt, N, C): FILE: Algorithms/DP/AdjacentBitCounts.cpp function findAns (line 20) | int findAns(int n, int k, int firstBit, int ***dp) function main (line 47) | int main() FILE: Algorithms/DP/AdjacentBitCounts.js function countStrings (line 4) | function countStrings(n, k) { FILE: Algorithms/DP/Bitmask DP/TravellingSalesman.cpp function solve (line 8) | int solve(int i, int mask, int n) function main (line 29) | signed main() FILE: Algorithms/DP/Branch_And_Bound/0_1_KnapSack.py function knapSack (line 3) | def knapSack(W, wt, val, n): FILE: Algorithms/DP/Branch_And_Bound/Knapsack_Branch_and_Bound.java class Knapsack_Branch_and_Bound (line 4) | public class Knapsack_Branch_and_Bound { class Node (line 11) | static class Node { method Node (line 16) | Node(int lvl, int val, double cap, double bound) { class List (line 26) | static class List { method add (line 30) | void add(Node n) method get (line 54) | Node get() { class Item (line 63) | static class Item { method Item (line 67) | Item(double weight, int value) { class Sort_Value_By_Weight (line 74) | static class Sort_Value_By_Weight implements Comparator { method compare (line 75) | public int compare(Item a, Item b) { method upperBound (line 88) | static double upperBound(Item item[], double cap, int k, int n) { method knapsackBnB (line 105) | static void knapsackBnB(Item[] item, int n, Node curr, List list) method main (line 131) | public static void main(String[] args) throws IOException{ FILE: Algorithms/DP/Count_Square_Matrices.cpp function main (line 4) | int main() FILE: Algorithms/DP/Count_Square_Matrices.py function countSquareMatrices (line 1) | def countSquareMatrices(a, N, M): FILE: Algorithms/DP/Edit_Distance/Edit_distance.cpp function main (line 14) | int main() { FILE: Algorithms/DP/Edit_Distance/edit_distance.py function edit_distance (line 11) | def edit_distance(string1, string2): FILE: Algorithms/DP/Egg_Drop/Egg_Drop.cpp function max (line 4) | int max(int a, int b) function EggDrop (line 10) | int EggDrop(int n, int k) function main (line 52) | int main() FILE: Algorithms/DP/Egg_Drop/Egg_Drop.cs class Program (line 5) | static class Program method Main (line 7) | private static void Main(string[] args) method max (line 15) | static int max(int a, int b) method eggDrop (line 23) | static int eggDrop(int n, int k) FILE: Algorithms/DP/Egg_Drop/egg drop.java class EggDroppDP (line 1) | public class EggDroppDP { method getDrops (line 3) | public int getDrops(int eggs, int floors){ method main (line 32) | public static void main(String[] args) { FILE: Algorithms/DP/Egg_Drop/egg_drop.py function egg_drop (line 3) | def egg_drop(n,k): FILE: Algorithms/DP/Fibonacci_Series/Fibonacci.c function main (line 2) | int main() FILE: Algorithms/DP/Fibonacci_Series/Fibonacci.php function fibonacci (line 13) | function fibonacci(int $n) : int { FILE: Algorithms/DP/Fibonacci_Series/fibonacci.go function Fibonacci (line 5) | func Fibonacci(n uint) uint64 { function main (line 19) | func main() { FILE: Algorithms/DP/Fibonacci_Series/fibonacci.js function fibonacci (line 4) | function fibonacci(n, memoizer) { FILE: Algorithms/DP/Fibonacci_Series/fibonacci.py function fibonacci (line 1) | def fibonacci(n): FILE: Algorithms/DP/Gauss_Easter_Date/CalculateEasterDate.java class CalculateEasterDate (line 8) | public class CalculateEasterDate { method main (line 19) | public static void main(String[] args) { method gaussEaster (line 24) | static void gaussEaster(int year) { method is29Days (line 43) | private static boolean is29Days(Double days, Double daysToSunday) { method is28Days (line 47) | private static boolean is28Days(Double days, Double daysToSunday) { method getGaussNumbers (line 51) | private static Map getGaussNumbers(int year) { method calculateCentury (line 69) | private static Double calculateCentury(Double yearsDividedBy100) { FILE: Algorithms/DP/Gauss_Easter_Date/Gauss_Easter_Date.cpp function main (line 6) | int main() function gaussAlgorithm (line 19) | void gaussAlgorithm(int year, int *month, int *day) //https://math.stack... FILE: Algorithms/DP/Gauss_Easter_Date/Gauss_Easter_Date.php function Gauss_Easter (line 2) | function Gauss_Easter($year){ FILE: Algorithms/DP/Gauss_Easter_Date/Gauss_Easter_Date.py function Easter (line 3) | def Easter(Year): FILE: Algorithms/DP/Gauss_Easter_Date/Gauss_Easter_Date.rb function gauss_easter (line 1) | def gauss_easter(y) FILE: Algorithms/DP/Gauss_Easter_Date/easterDate.cpp function main (line 6) | int main() FILE: Algorithms/DP/Gauss_Easter_Date/easterDate.go function getEasterDate (line 5) | func getEasterDate(_year int) { function main (line 19) | func main() { FILE: Algorithms/DP/Gauss_Easter_Date/easterDate.java class Main (line 6) | class Main { method gaussEaster (line 8) | static void gaussEaster(int Y) method main (line 62) | public static void main(String[] args) FILE: Algorithms/DP/Gold_Mine_Problem/goldmine.java class goldmine (line 4) | class goldmine { method getMaxGold (line 12) | static int getMaxGold(int gold[][], int m, int n) method main (line 68) | public static void main(String arg[]) FILE: Algorithms/DP/Gold_Mine_Problem/goldmine.py function getMaxGold (line 4) | def getMaxGold(gold, m, n): FILE: Algorithms/DP/Golomb_Sequence/Golomb Sequence.cpp function printGolomb (line 4) | void printGolomb(int n) function main (line 15) | int main() FILE: Algorithms/DP/Golomb_Sequence/Golomb.cpp function printGolomb (line 8) | void printGolomb(int n) function main (line 25) | int main() FILE: Algorithms/DP/Golomb_Sequence/Golomb.java class Golomb (line 3) | class Golomb method printGolomb (line 6) | public static void printGolomb(int n) method main (line 18) | public static void main (String[] args) FILE: Algorithms/DP/Golomb_Sequence/golomb.py function findGolomb (line 2) | def findGolomb(n): function printGolomb (line 9) | def printGolomb(n): FILE: Algorithms/DP/Knight_Probability/Knight_Probability_in_a_ChessBoard.cpp function knightProbability (line 4) | double knightProbability(int N, int K, int sr, int sc) function main (line 33) | int main() FILE: Algorithms/DP/LCS/LCS_of_three_strings.py function three_LCS (line 1) | def three_LCS(A,B,C): FILE: Algorithms/DP/LCS/LongestCommonSubsequence.cpp function LCS (line 4) | int LCS(string s1, string s2){//function to get the longest common subse... function main (line 16) | int main() FILE: Algorithms/DP/LCS/LongestCommonSubsequenceLength.java class LongestCommonSubsequenceLength (line 2) | class LongestCommonSubsequenceLength{ method main (line 3) | public static void main(String[]args){ FILE: Algorithms/DP/LCS/Longest_Common_Subsequence_of_Three_String.java class LCS3Strings (line 3) | class LCS3Strings { method lcsOf3 (line 4) | public static int lcsOf3(String X, String Y, String Z, int m,int n, in... method main (line 33) | public static void main(String args[]) FILE: Algorithms/DP/LCS/Longest_Common_Subsequence_of_Two_Sequences.c function max (line 18) | int max(int a,int b) { function main (line 25) | int main() { FILE: Algorithms/DP/LCS/Longest_Common_Subsequence_of_Two_Sequences.cpp function max (line 18) | int max(int a,int b) { function main (line 25) | int main() { FILE: Algorithms/DP/LCS/lcs_of_3_strings.cpp function main (line 14) | signed main() FILE: Algorithms/DP/LIS/LIS.c function lis (line 5) | int lis( int arr[], int n ) function main (line 31) | int main() FILE: Algorithms/DP/LIS/LIS.cpp function main (line 36) | int main() FILE: Algorithms/DP/LIS/LIS.go function binarySearch (line 5) | func binarySearch(array []int, l int, r int, key int) int { function LongestIncreasingSubsequence (line 20) | func LongestIncreasingSubsequence(input []int) int { function main (line 43) | func main() { FILE: Algorithms/DP/LIS/LIS.java class Main (line 21) | class Main method findLIS (line 23) | public static void findLIS(int[] arr) method main (line 64) | public static void main(String[] args) FILE: Algorithms/DP/LIS/LongestIncreaseSubSequence.cpp function lis (line 4) | int lis(int* input, int n) { function main (line 29) | int main() { FILE: Algorithms/DP/LIS/lis.py function lis (line 1) | def lis(arr): FILE: Algorithms/DP/LSCS/LSCS.c function largest_subarray_sum (line 4) | int largest_subarray_sum(int *arr, int size) FILE: Algorithms/DP/LSCS/LSCS.cpp function maxSubArraySum (line 5) | int maxSubArraySum(int a[], int size) FILE: Algorithms/DP/LSCS/lscs.go function max (line 5) | func max(x, y int) int { function sol (line 12) | func sol(s1 string, s2 string, n int, m int) int { function main (line 29) | func main() { FILE: Algorithms/DP/LSCS/lscs.py function find_max_subarray (line 1) | def find_max_subarray(alist, start, end): FILE: Algorithms/DP/LSCS/shortest_common_supersequence.c function max (line 2) | int max(int a,int b) function sol (line 6) | int sol(char* s1,char* s2,int n,int m) function main (line 27) | int main() { FILE: Algorithms/DP/Largest Divisible Subset.cpp function largestDivisibleSubset (line 21) | vector largestDivisibleSubset(vector& nums) function main (line 54) | int main() FILE: Algorithms/DP/Largest divisible subset in array/file.py function findLargest (line 4) | def findLargest(arr, n): FILE: Algorithms/DP/Largest_Divisible_Subsets.java class DivSubset (line 3) | public class DivSubset { method findLargest (line 7) | static void findLargest(int[] arr) { method main (line 37) | public static void main(String[] args) { FILE: Algorithms/DP/Largest_Divisible_Subsets.py function largestDivisibleSubset (line 1) | def largestDivisibleSubset(nums): FILE: Algorithms/DP/Largest_Sum_Contiguous_Subarray/C++_Implementation/src/functions.cpp function Kadane (line 4) | int Kadane(int arr[], int size) FILE: Algorithms/DP/Largest_Sum_Contiguous_Subarray/C++_Implementation/src/main.cpp function main (line 5) | int main() FILE: Algorithms/DP/Largest_Sum_Contiguous_Subarray/Kadane's Algorithm.cpp function main (line 6) | int main() { FILE: Algorithms/DP/Largest_Sum_Contiguous_Subarray/LSCS.cpp function Kadane (line 3) | int Kadane(int arr[], int size) FILE: Algorithms/DP/Largest_Sum_Contiguous_Subarray/lscs.c function max (line 3) | int max(int a,int b) function maxSubArray (line 12) | int maxSubArray(int* nums, int numsSize){ function main (line 39) | int main() { FILE: Algorithms/DP/MOS_Algorithm.cpp type Mo (line 11) | struct Mo method process (line 17) | void process(int number, int delta) method Mo (line 24) | Mo() method get_answer (line 30) | long long get_answer() const method add (line 35) | void add(int number) method remove (line 40) | void remove(int number) function main (line 46) | int main() FILE: Algorithms/DP/Max_Product_Subarray/max_product_subarray.py function max_product (line 1) | def max_product(nums): FILE: Algorithms/DP/Maximum_Achievable_Coins/Maximum_Achievable_Coins.php function maxAchieveable (line 2) | function maxAchieveable($num) FILE: Algorithms/DP/Maximum_Achievable_Coins/Maximum_Achievable_coins.c function swap (line 3) | void swap(int *xp, int *yp) function bubbleSort (line 11) | void bubbleSort(int arr[], int n) function main (line 22) | int main(void) { FILE: Algorithms/DP/Maximum_Achievable_Coins/Maximum_Achievable_coins.java class MaximumAchievablecoins (line 2) | class MaximumAchievablecoins { method Maximum_Achievable_coins (line 4) | static int Maximum_Achievable_coins( method main (line 36) | public static void main(String[] args) FILE: Algorithms/DP/Maximum_Achievable_Coins/Maximum_Achievable_coins.py function Maximum_Achievable_coins (line 1) | def Maximum_Achievable_coins(arr, n): FILE: Algorithms/DP/Maximum_Achievable_Coins/maximum_achievable_coins.cpp function optimalStrategyOfGame (line 6) | int optimalStrategyOfGame( function main (line 36) | int main() FILE: Algorithms/DP/Minimum_Sum_Descent/min-sum.c function minimum (line 26) | int minimum(int a, int b){ function tabular (line 33) | int tabular(int ** arr, int n){ function main (line 45) | int main(){ FILE: Algorithms/DP/Minimum_Sum_Descent/minsum.cs class Program (line 7) | class Program method Main (line 9) | static void Main(string[] args) class Triangle (line 19) | class Triangle method minSumPath (line 22) | public static int minSumPath(ref List> A) FILE: Algorithms/DP/Minimum_Sum_Descent/minsum.go function main (line 7) | func main() { function minimum (line 44) | func minimum(a, b int) int { function tabular (line 54) | func tabular(arr [][]int, n int) int { FILE: Algorithms/DP/Partition_Sum/DP_PartitionSum.java class DP_PartitionSum (line 4) | public class DP_PartitionSum method checking (line 6) | public static boolean checking(int arr[],int SUM) method main (line 34) | public static void main(String[] args) FILE: Algorithms/DP/Partition_Sum/partition_sum.c function findPartiion (line 5) | int findPartiion (int arr[], int n) function main (line 42) | int main() FILE: Algorithms/DP/Partition_Sum/partition_sum.cpp function findPartiion (line 6) | bool findPartiion (int arr[], int n) function main (line 44) | int main() FILE: Algorithms/DP/Partition_Sum/partition_sum.cs class GFG (line 4) | class GFG { method isSubsetSum (line 8) | static bool isSubsetSum(int[] arr, int n, int sum) method findPartition (line 32) | static bool findPartition(int[] arr, int n) method Main (line 50) | public static void Main() FILE: Algorithms/DP/Partition_Sum/partition_sum.php function partitionSum (line 4) | function partitionSum(array $input): array FILE: Algorithms/DP/Recaman's Sequence.c function main (line 3) | int main() FILE: Algorithms/DP/Scramble Strings/ScrambleString.cpp function scramble (line 5) | bool scramble(string s1,string s2) function isScramble (line 33) | bool isScramble(string s1, string s2) { function main (line 45) | int main() FILE: Algorithms/DP/Shortest_Common_Supersequence/shortest_common_sequence.java class Solution (line 1) | class Solution { method shortestCommonSupersequence (line 3) | public String shortestCommonSupersequence(String str1, String str2) { FILE: Algorithms/DP/Shortest_Common_Supersequence/shortest_common_supersequence.cpp function max (line 4) | int max(int a, int b) function shortestSuperSequence (line 11) | int shortestSuperSequence(string X, string Y) function lcs (line 20) | int lcs(string X,string Y,int m,int n) function main (line 40) | int main() FILE: Algorithms/DP/Shortest_Common_Supersequence/shortest_common_supersequence.cs class SCS (line 3) | class SCS method printShortestSuperSeq (line 7) | static String printShortestSuperSeq(String X, String Y) method reverse (line 96) | static String reverse(String input) method Main (line 112) | public static void Main(String[] args) FILE: Algorithms/DP/Shortest_Common_Supersequence/shortest_common_supersequence.js function shortestCommonSuperstring (line 4) | function shortestCommonSuperstring(str1, str2) { FILE: Algorithms/DP/Shortest_Common_Supersequence/shortest_common_supersequence.py function superSeq (line 7) | def superSeq(X, Y, m, n): FILE: Algorithms/DP/Sudoku_Solver/SudokuSolver.java class SudokuSolver (line 3) | class SudokuSolver { class FastReader (line 4) | static class FastReader{ method FastReader (line 7) | FastReader(){ method next (line 10) | String next(){ method nextInt (line 21) | int nextInt(){ method main (line 25) | public static void main(String[] args) { method isSafe (line 36) | public static boolean isSafe(int[][] board,int row,int col,int index){ method solveSudoku (line 61) | public static void solveSudoku(int[][] board, int row, int col){ FILE: Algorithms/DP/Sudoku_Solver/SudokuSolver.py function print_grid (line 2) | def print_grid(arr): function find_empty_location (line 9) | def find_empty_location(arr, l): function used_in_row (line 18) | def used_in_row(arr, row, num): function used_in_col (line 24) | def used_in_col(arr, col, num): function used_in_box (line 30) | def used_in_box(arr, row, col, num): function check_location_is_safe (line 37) | def check_location_is_safe(arr, row, col, num): function solve_sudoku (line 41) | def solve_sudoku(arr): FILE: Algorithms/DP/Sudoku_Solver/Sudoku_Solver.cpp function SolveSudoku (line 18) | bool SolveSudoku(int grid[N][N]) function FindUnassignedLocation (line 47) | bool FindUnassignedLocation(int grid[N][N], function UsedInRow (line 58) | bool UsedInRow(int grid[N][N], int row, int num) function UsedInCol (line 67) | bool UsedInCol(int grid[N][N], int col, int num) function UsedInBox (line 76) | bool UsedInBox(int grid[N][N], int boxStartRow, function isSafe (line 89) | bool isSafe(int grid[N][N], int row, function printGrid (line 101) | void printGrid(int grid[N][N]) function main (line 111) | int main() FILE: Algorithms/DP/Sudoku_Solver/Sudoku_Solver.cs class GFG (line 3) | class GFG { method isSafe (line 5) | public static bool isSafe(int[, ] board, method solveSudoku (line 38) | public static bool solveSudoku(int[, ] board, int n) method print (line 76) | public static void print(int[, ] board, int N) method Main (line 90) | public static void Main(String[] args) FILE: Algorithms/DP/Sudoku_Solver/Sudoku_Solver.js function isValid (line 17) | function isValid(board, row, col, k) { function sodokuSolver (line 29) | function sodokuSolver(data) { FILE: Algorithms/DP/Target_Sum/Target_Sum.c function CntSum (line 4) | int CntSum(int arr[], int N, int required_sum) function main (line 23) | int main() FILE: Algorithms/DP/Target_Sum/Target_Sum.cpp function SubsetSum (line 5) | int SubsetSum(int arr[],int n, int sum) function main (line 27) | int main() FILE: Algorithms/DP/Target_Sum/Target_Sum.java class Target_Sum (line 4) | public class Target_Sum method Sum (line 7) | static int Sum(int arr[], int n, int i, method main (line 25) | public static void main(String[] args) FILE: Algorithms/DP/Target_Sum/Target_Sum.js function targetSum (line 1) | function targetSum(arr, target) { function countSub (line 5) | function countSub(arr, n, i, sum, count) { FILE: Algorithms/DP/Target_Sum/Target_Sum.py function findNumberOfSubsetsMemo (line 7) | def findNumberOfSubsetsMemo(arr, i, targetSum, n) : function findNumberOfSubsetsRecur (line 34) | def findNumberOfSubsetsRecur(arr, n, i,sum, count): FILE: Algorithms/DP/Tower_Of_Hanoi/TOH.java class TowersOfHanoi (line 5) | public class TowersOfHanoi { method solveTowersOfHanoi (line 7) | public void solveTowersOfHanoi(int n, String source, String aux, Strin... method main (line 27) | public static void main(String args[]) FILE: Algorithms/DP/Tower_Of_Hanoi/Tower_Of_Hanoi.cs class Tower_Of_Hanoi (line 5) | class Tower_Of_Hanoi method Main (line 7) | static void Main(string[] args) method TowerOfHanoi (line 26) | public static void TowerOfHanoi(int numDisk, char source, char auxilia... FILE: Algorithms/DP/Tower_Of_Hanoi/Tower_Of_Hanoi.js function Tower_Of_Hanoi (line 3) | function Tower_Of_Hanoi () { FILE: Algorithms/DP/Tower_Of_Hanoi/Tower_of_hanoi.ts function solveHanoi (line 1) | function solveHanoi( FILE: Algorithms/DP/Tower_Of_Hanoi/tower_of_hanoi.c function hanoi (line 3) | void hanoi(char from, char helper, char to, int n) { function main (line 16) | int main() { FILE: Algorithms/DP/Tower_Of_Hanoi/tower_of_hanoi.cpp function towerOfHanoi (line 5) | void towerOfHanoi(char from,char to,char aux,int n){ function main (line 16) | int main(){ FILE: Algorithms/DP/Tower_Of_Hanoi/tower_of_hanoi.go function main (line 16) | func main() { function moveTower (line 37) | func moveTower(height int, from int, to int, help int) { function moveDisc (line 47) | func moveDisc(index int, from int, to int) { function printStacks (line 56) | func printStacks() { FILE: Algorithms/DP/Tower_Of_Hanoi/tower_of_hanoi.py function TowerOfHanoi (line 1) | def TowerOfHanoi(n , source, destination, auxiliary): FILE: Algorithms/DP/TrappingWater/TrappingWater.cpp function trap (line 8) | int trap(vector& h) { function main (line 30) | int main(){ FILE: Algorithms/DP/Water_Area/Water-area.py function waterArea (line 3) | def waterArea(heights): FILE: Algorithms/DP/Water_Area/water_area.rb function calculateWaterArea (line 3) | def calculateWaterArea(pillarHeights) FILE: Algorithms/DP/Z_Algorithm/Z_Algo.py function get_Z_arr (line 17) | def get_Z_arr(pattern, text): function ZSearch (line 77) | def ZSearch(text, pattern): function main (line 90) | def main(): FILE: Algorithms/DP/creating an string input function in C.c function input (line 3) | int input(char str[],int n) function main (line 16) | int main() FILE: Algorithms/DP/partition_sum.py function findPartition (line 1) | def findPartition(arr, n): FILE: Algorithms/DP/rod-cutting-problem.cpp function rodCut (line 13) | int rodCut(vector price,int n){ function main (line 28) | int main() { FILE: Algorithms/Graph/A_Star/A_star.cpp type cell (line 7) | struct cell function isValid (line 12) | bool isValid(int row, int col) function isUnBlocked (line 17) | bool isUnBlocked(int grid[][COL], int row, int col) function isDestination (line 25) | bool isDestination(int row, int col, Pair dest) function calculateHValue (line 33) | double calculateHValue(int row, int col, Pair dest) function tracePath (line 38) | void tracePath(cell cellDetails[][COL], Pair dest) function aStarSearch (line 66) | void aStarSearch(int grid[][COL], Pair src, Pair dest) function main (line 441) | int main() FILE: Algorithms/Graph/A_Star/A_star.cs class AStar (line 12) | public class AStar method AStar (line 18) | public AStar(IList nodes, Point start, Point finish) method GetPath (line 25) | public IEnumerable GetPath() method PathExists (line 43) | private bool PathExists(Node currentNode) method GetSurroundingWalkableNodes (line 69) | private IEnumerable GetSurroundingWalkableNodes(Node currentNode) method GetSurroundingPoints (line 98) | private IEnumerable GetSurroundingPoints(Node currentNode) method UpdateNodeParameters (line 106) | private Node UpdateNodeParameters(Node nextNode, Node currentNode) method StraightLineDistance (line 126) | private double StraightLineDistance(Point a, Point b) method ReadPath (line 133) | private IEnumerable ReadPath() class Node (line 149) | public class Node method Node (line 159) | public Node(int x, int y, bool isWalkable) type NodeState (line 166) | public enum NodeState class Tools (line 223) | public static class Tools { method PrintMaze (line 224) | public static void PrintMaze(List maze, IList solution, P... method GetCharacter (line 246) | private static char GetCharacter(IList solution, Point? start, ... method SetConsoleColor (line 257) | private static void SetConsoleColor(IList solution, Node node, ... FILE: Algorithms/Graph/A_Star/A_star.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, position:(), parent:()): method __eq__ (line 8) | def __eq__(self, other): method __lt__ (line 10) | def __lt__(self, other): method __repr__ (line 13) | def __repr__(self): function draw_grid (line 16) | def draw_grid(map, width, height, spacing=2, **kwargs): function draw_tile (line 22) | def draw_tile(map, position, kwargs): function astar_search (line 32) | def astar_search(map, start, end): function add_to_open (line 81) | def add_to_open(open, neighbor): function main (line 86) | def main(): FILE: Algorithms/Graph/A_Star/A_star.ts class GraphNode (line 8) | class GraphNode { method constructor (line 16) | constructor(position: Position, parent?: GraphNode) { method isEqual (line 24) | isEqual(other: Position): boolean { class Position (line 169) | class Position { method constructor (line 170) | constructor(public x: number, public y: number) {} FILE: Algorithms/Graph/A_Star/astar.py class Node (line 1) | class Node(): method __init__ (line 2) | def __init__(self, parent=None, position=None): method __eq__ (line 8) | def __eq__(self, other): function astar (line 10) | def astar(maze, start, end): function main (line 56) | def main(): FILE: Algorithms/Graph/BFS/BFS.c type queue (line 7) | struct queue { type queue (line 13) | struct queue type queue (line 14) | struct queue type queue (line 15) | struct queue type queue (line 16) | struct queue type queue (line 17) | struct queue type queue (line 18) | struct queue type node (line 20) | struct node { type node (line 25) | struct node type Graph (line 27) | struct Graph { function bfs (line 34) | void bfs(struct Graph* graph, int startVertex) { type node (line 60) | struct node type node (line 61) | struct node type node (line 61) | struct node type Graph (line 68) | struct Graph type Graph (line 69) | struct Graph type Graph (line 69) | struct Graph type node (line 72) | struct node function addEdge (line 85) | void addEdge(struct Graph* graph, int src, int dest) { type queue (line 98) | struct queue type queue (line 99) | struct queue type queue (line 99) | struct queue function isEmpty (line 106) | int isEmpty(struct queue* q) { function enqueue (line 114) | void enqueue(struct queue* q, int value) { function dequeue (line 126) | int dequeue(struct queue* q) { function printQueue (line 143) | void printQueue(struct queue* q) { function main (line 156) | int main() { FILE: Algorithms/Graph/BFS/BFS.cpp class Graph (line 8) | class Graph function main (line 76) | int main() FILE: Algorithms/Graph/BFS/BFS.go type node (line 11) | type node struct function Nodes (line 17) | func Nodes(n *node) []*node { function main (line 49) | func main() { FILE: Algorithms/Graph/BFS/BFS.java class Graph (line 6) | class Graph method Graph (line 12) | Graph(int v) method addEdge (line 21) | void addEdge(int v,int w) method BFS (line 27) | void BFS(int s) method main (line 63) | public static void main(String args[]) FILE: Algorithms/Graph/BFS/BFS.py function BFS (line 9) | def BFS(graph, point, explored, to_explore): FILE: Algorithms/Graph/BFS/BFS.rb function bfs (line 1) | def bfs(node) FILE: Algorithms/Graph/BFS/bfs.js function bfs (line 1) | function bfs(at) { function addNode (line 27) | function addNode(node) { function addEdge (line 32) | function addEdge(origin, destination) { FILE: Algorithms/Graph/Bellman_Ford/BellMan_Ford.py class Graph (line 4) | class Graph: method __init__ (line 7) | def __init__(self, nodes): method createEdge (line 13) | def createEdge(self, u, v, weight): class Solution (line 22) | class Solution: method printSoln (line 25) | def printSoln(self, dist, src): method bellmanFord (line 31) | def bellmanFord(self, graph, src): FILE: Algorithms/Graph/Bellman_Ford/bellmanFord.cpp type Edge (line 6) | struct Edge { type Graph (line 12) | struct Graph { type Edge (line 17) | struct Edge type Graph (line 21) | struct Graph type Edge (line 17) | struct Edge type Graph (line 23) | struct Graph type Edge (line 17) | struct Edge function printArr (line 31) | void printArr(int dist[], int n) function BellmanFord (line 41) | void BellmanFord(struct Graph* graph, int src) function main (line 86) | int main() FILE: Algorithms/Graph/Bellman_Ford/bellman_ford.c type Edge (line 6) | struct Edge type Graph (line 14) | struct Graph type Graph (line 23) | struct Graph type Graph (line 25) | struct Graph type Graph (line 25) | struct Graph type Graph (line 25) | struct Graph type Edge (line 32) | struct Edge type Edge (line 32) | struct Edge function FinalSolution (line 38) | void FinalSolution(int dist[], int n) function BellmanFord (line 49) | void BellmanFord(struct Graph* graph, int source) function main (line 104) | int main() FILE: Algorithms/Graph/Bidirectional_search/Bidirectional_Search.py class AdjacentNode (line 6) | class AdjacentNode: method __init__ (line 8) | def __init__(self, vertex): class BidirectionalSearch (line 14) | class BidirectionalSearch: method __init__ (line 16) | def __init__(self, vertices): method add_edge (line 39) | def add_edge(self, src, dest): method bfs (line 55) | def bfs(self, direction = 'forward'): method is_intersecting (line 89) | def is_intersecting(self): method print_path (line 101) | def print_path(self, intersecting_node, method bidirectional_search (line 127) | def bidirectional_search(self, src, dest): FILE: Algorithms/Graph/Bidirectional_search/Bidirectional_search.cpp class Graph (line 8) | class Graph function main (line 167) | int main() FILE: Algorithms/Graph/Bidirectional_search_algo.py class AdjacentNode (line 3) | class AdjacentNode: method __init__ (line 5) | def __init__(self, vertex): class BidirectionalSearch (line 9) | class BidirectionalSearch: method __init__ (line 10) | def __init__(self, vert): method add_edge (line 21) | def add_edge(self, src, dest): method bfs (line 30) | def bfs(self, direction='forward'): method is_intersecting (line 55) | def is_intersecting(self): method print_path (line 66) | def print_path(self, intersecting_node,src, dest): # ... method bidirectional_search (line 87) | def bidirectional_search(self, src, dest): FILE: Algorithms/Graph/DFS/DFS.cpp class Graph (line 8) | class Graph function main (line 70) | int main() FILE: Algorithms/Graph/DFS/DFS.java class Graph (line 7) | class Graph method Graph (line 15) | @SuppressWarnings("unchecked") method addEdge (line 25) | void addEdge(int v, int w) method DFSUtil (line 31) | void DFSUtil(int v,boolean visited[]) method DFS (line 48) | void DFS(int v) method main (line 58) | public static void main(String args[]) FILE: Algorithms/Graph/DFS/Depth First Search[DFS].cpp class Graph (line 7) | class Graph { function main (line 43) | int main() { FILE: Algorithms/Graph/DFS/dfs.js function dfs (line 1) | function dfs(at) { function addNode (line 16) | function addNode(node) { function addEdge (line 21) | function addEdge(origin, destination) { FILE: Algorithms/Graph/DFS/dfs.py class Graph (line 28) | class Graph(object): method __init__ (line 29) | def __init__(self): method addNode (line 33) | def addNode(self, node): method addEdge (line 37) | def addEdge(self, edge): method peek (line 41) | def peek(self): function dfs (line 69) | def dfs(currNode): FILE: Algorithms/Graph/DSU/dsu.cpp class AbstractDSU (line 50) | class AbstractDSU method process_set_boundaries (line 70) | bool process_set_boundaries(int x) method AbstractDSU (line 78) | AbstractDSU(int n) : prev(n + 1), rank(n + 1) method find_set (line 92) | int find_set(int v) method union_sets (line 107) | void union_sets(int a, int b) class DSUBySize (line 133) | class DSUBySize : public AbstractDSU method DSUBySize (line 138) | DSUBySize(int n) : AbstractDSU(n) {} method update_rank (line 139) | void update_rank(int x, int y) class DSUByRank (line 145) | class DSUByRank : public AbstractDSU method DSUByRank (line 150) | DSUByRank(int n) : AbstractDSU(n) {} method update_rank (line 151) | void update_rank(int x, int y) function main (line 160) | int main() FILE: Algorithms/Graph/DSU/dsu.py class AbstractDSU (line 51) | class AbstractDSU: method __init__ (line 66) | def __init__(self, n): method _process_set_boundaries (line 70) | def _process_set_boundaries(self, x): method find_set (line 84) | def find_set(self, v): method union_sets (line 101) | def union_sets(self, a, b): method update_ranks (line 123) | def update_ranks(self, x, y): class DSUBySize (line 135) | class DSUBySize(AbstractDSU): method update_ranks (line 138) | def update_ranks(self, x, y): class DSUByRank (line 142) | class DSUByRank(AbstractDSU): method update_ranks (line 145) | def update_ranks(self, x, y): FILE: Algorithms/Graph/Depth First Transversal/DFT.py class graph (line 1) | class graph: method __init__ (line 3) | def __init__(self,gdict=None): function dfs (line 8) | def dfs(graph, start, visited = None): FILE: Algorithms/Graph/Dijkstra/Dijikstra.java class Dijikstra (line 1) | class Dijikstra { method minDistance (line 3) | int minDistance(int dist[], Boolean sptSet[]) { method printSolution (line 15) | void printSolution(int dist[]) { method dijkstra (line 21) | void dijkstra(int graph[][], int src) { method main (line 42) | public static void main(String[] args) { FILE: Algorithms/Graph/Dijkstra/Dijkstra.c function getMinVertex (line 5) | int getMinVertex(bool* visited,int* distance,int n){ function dijkstra (line 15) | void dijkstra(int** edges,int n){ function main (line 38) | int main(){ FILE: Algorithms/Graph/Dijkstra/Dijkstra.cpp class Graph (line 14) | class Graph{ function main (line 69) | int main(){ FILE: Algorithms/Graph/Dijkstra/Dijkstra.cs class DA (line 3) | class DA { method minDistance (line 5) | int minDistance(int[] dist, method printSolution (line 18) | void printSolution(int[] dist, int n) method dijkstra (line 25) | void dijkstra(int[, ] graph, int src) method Main (line 51) | public static void Main() FILE: Algorithms/Graph/Dijkstra/Dijkstra.go type PriorityQueue (line 9) | type PriorityQueue struct method Len (line 15) | func (pq *PriorityQueue) Len() int { method Less (line 19) | func (pq *PriorityQueue) Less(i, j int) bool { method Swap (line 23) | func (pq *PriorityQueue) Swap(i, j int) { method Push (line 29) | func (pq *PriorityQueue) Push(x interface{}) { method Pop (line 36) | func (pq *PriorityQueue) Pop() interface{} { method update (line 45) | func (pq *PriorityQueue) update(item Vertex, priority int) { method addWithPriority (line 50) | func (pq *PriorityQueue) addWithPriority(item Vertex, priority int) { type Graph (line 56) | type Graph interface type Vertex (line 63) | type Vertex type DijkstraGraph (line 67) | type DijkstraGraph struct method edge (line 83) | func (dg DijkstraGraph) edge(u, v string, w int) { method path (line 89) | func (dg DijkstraGraph) path(v Vertex, path map[Vertex]Vertex) (s stri... method Vertices (line 97) | func (dg DijkstraGraph) Vertices() []Vertex { method Neighbors (line 104) | func (dg DijkstraGraph) Neighbors(u Vertex) []Vertex { method Weight (line 111) | func (dg DijkstraGraph) Weight(u, v Vertex) int { return dg.edges[u][v] } function NewDijkstraGraph (line 74) | func NewDijkstraGraph(ids map[string]Vertex) DijkstraGraph { constant Infinity (line 114) | Infinity = int(^uint(0) >> 1) constant Uninitialized (line 115) | Uninitialized = -1 function Dijkstra (line 119) | func Dijkstra(g Graph, source Vertex) (dist map[Vertex]int, path map[Ver... function main (line 151) | func main() { FILE: Algorithms/Graph/Dijkstra/Dijkstra.php class Vertex (line 3) | class Vertex { method __construct (line 6) | public function __construct() { method addEdge (line 10) | public function addEdge($to, $d) { class MinHeap (line 15) | class MinHeap extends SplPriorityQueue { method compare (line 16) | public function compare($p1, $p2) { class Graph (line 21) | class Graph { method __construct (line 24) | public function __construct() { method insertVertex (line 28) | public function insertVertex($label) { method insertEdge (line 32) | public function insertEdge($from, $to, $d) { method dijkstra (line 36) | public function dijkstra($from, $destination) { method pathToString (line 74) | public function pathToString($prev, $destination) { FILE: Algorithms/Graph/Dijkstra/dijkstra_leftist_heap/WDGraph.cpp function VertexNode (line 162) | VertexNode* WDGraph::getVertex(int e) { FILE: Algorithms/Graph/Dijkstra/dijkstra_leftist_heap/WDGraph.h function class (line 30) | class EdgeNode { // Edges function class (line 41) | class VertexNode { // Adyacency list (linked list) function class (line 55) | class WDGraph { FILE: Algorithms/Graph/Dijkstra/dijkstra_leftist_heap/dijkstra.cpp function main (line 19) | int main(int argc, char **argv) { function dijkstra (line 47) | void dijkstra(WDGraph g, int src) { function readGraph (line 85) | void readGraph(WDGraph &g) { function createGraph (line 94) | void createGraph(int N_VERTICES, int MAX_WEIGHT, float EDGE_CHANCE, long... FILE: Algorithms/Graph/Dijkstra/dijkstra_leftist_heap/leftistHeap.cpp function LeftistHeap (line 139) | LeftistHeap& LeftistHeap::operator =(LeftistHeap &h) { function Node (line 153) | Node* LeftistHeap::mergeHeaps(Node *heap1, Node *heap2) { function Node (line 164) | Node* LeftistHeap::MergeRecursive(Node *heap1, Node *heap2) { function Node (line 193) | Node* LeftistHeap::cloneNode(Node *node) { FILE: Algorithms/Graph/Dijkstra/dijkstra_leftist_heap/leftistHeap.h function class (line 31) | class Node { function class (line 44) | class LeftistHeap { FILE: Algorithms/Graph/Dijkstra/djikstra.py class Graph (line 3) | class Graph(): method __init__ (line 5) | def __init__(self, vertices): method printSolution (line 10) | def printSolution(self, dist): method minDistance (line 15) | def minDistance(self, dist, sptSet): method dijkstra (line 26) | def dijkstra(self, src): FILE: Algorithms/Graph/Flood_Fill/Flood_Fill.cpp function floodFillUtil (line 7) | void floodFillUtil(int screen[][N], int x, int y, int prevC, int newC) function floodFill (line 24) | void floodFill(int screen[][N], int x, int y, int newC) function main (line 30) | int main() FILE: Algorithms/Graph/Flood_Fill/Flood_Fill.java class GFG (line 2) | class GFG method floodFillUtil (line 11) | static void floodFillUtil(int screen[][], int x, int y,int prevC, int ... method floodFill (line 31) | static void floodFill(int screen[][], int x, int y, int newC) method main (line 38) | public static void main(String[] args) FILE: Algorithms/Graph/Flood_Fill/Flood_Fill.js class Image (line 3) | class Image { method constructor (line 4) | constructor (imageAsMatrix) { method COLORS (line 8) | static get COLORS () { method get (line 17) | get () { method randomColor (line 21) | randomColor () { method buildWhithRandomColors (line 26) | buildWhithRandomColors (rows = 5, cols = 5) { class Floodfill (line 34) | class Floodfill { method constructor (line 35) | constructor (imageAsMatrix) { method get (line 39) | get () { method bucket (line 43) | bucket (row, column, newPixel) { method fill (line 52) | fill (row, column, newPixel, currentPixel) { method fillCurrentPixel (line 67) | fillCurrentPixel (row, column, newPixel) { method fillPreviousRow (line 71) | fillPreviousRow (row, column, newPixel, currentPixel) { method fillNextRow (line 75) | fillNextRow (row, column, newPixel, currentPixel) { method fillPreviousCol (line 79) | fillPreviousCol (row, column, newPixel, currentPixel) { method fillNextCol (line 83) | fillNextCol (row, column, newPixel, currentPixel) { method rowIsLessThenZero (line 87) | rowIsLessThenZero (row) { method columnIsLessThenZero (line 91) | columnIsLessThenZero (column) { method rowIsGreaterThenImageLength (line 95) | rowIsGreaterThenImageLength (row) { method columnIsGreaterThenImageLength (line 99) | columnIsGreaterThenImageLength (row, column) { method currentPixelNoNeedToFill (line 103) | currentPixelNoNeedToFill (row, column, currentPixel) { FILE: Algorithms/Graph/Flood_Fill/flood_fill_algorithm.cs class Uebung1_2 (line 1) | public class Uebung1_2 FILE: Algorithms/Graph/Floyd_Warshall/Floyd_Warshall.c function floydWarshall (line 15) | void floydWarshall (int graph[][V]) function printSolution (line 56) | void printSolution(int dist[][V]) function main (line 74) | int main() FILE: Algorithms/Graph/Floyd_Warshall/Floyd_Warshall.cpp function floydWarshall (line 14) | void floydWarshall(int graph[][nV]) { function printMatrix (line 32) | void printMatrix(int matrix[][nV]) { function main (line 44) | int main() { FILE: Algorithms/Graph/Floyd_Warshall/Floyd_Warshall.java class Floyd_Warshall (line 3) | public class Floyd_Warshall { method warshall (line 18) | public void warshall() { FILE: Algorithms/Graph/Floyd_Warshall/Floyd_Warshall.py function floydWarshall (line 11) | def floydWarshall(graph): function printSolution (line 49) | def printSolution(dist): FILE: Algorithms/Graph/Hopcroft_Karp/Hopcroft_Karp_algorithm.cpp class bipartiteGraph (line 28) | class bipartiteGraph function main (line 198) | int main() FILE: Algorithms/Graph/Johnson_algorithm/Johnson_algorithm.cpp type Edge (line 74) | struct Edge { type Graph (line 80) | struct Graph { type Edge (line 85) | struct Edge type Graph (line 89) | struct Graph type Edge (line 85) | struct Edge type Graph (line 91) | struct Graph type Edge (line 85) | struct Edge function BellmanFord (line 102) | vector BellmanFord(struct Graph* graph) function printSolution (line 155) | void printSolution(int dist[]) function minDistance (line 165) | int minDistance(int dist[], bool sptSet[], int V) function dijkstra (line 179) | void dijkstra(struct Graph* graph, int src, vector h){ function johnsonAlgorithm (line 221) | void johnsonAlgorithm(struct Graph* graph){ function main (line 246) | int main() FILE: Algorithms/Graph/Karger_algorithm/Karger_algorithm.cpp type std (line 8) | namespace std { } class karger_graph (line 11) | class karger_graph method set (line 14) | void set(size_t r, size_t c, size_t d) { _data[(r * _rc) + c] = d;... method get (line 15) | size_t get(size_t r, size_t c) const { return _data[(r * _rc) + c]; } method set_size (line 17) | void set_size(size_t rc) { _rc = rc; _data.resize(_rc * _rc); ... method get_size (line 18) | size_t get_size() const { return _rc; } function karger_graph (line 66) | karger_graph& karger_graph::remove_self_loops() method set (line 14) | void set(size_t r, size_t c, size_t d) { _data[(r * _rc) + c] = d;... method get (line 15) | size_t get(size_t r, size_t c) const { return _data[(r * _rc) + c]; } method set_size (line 17) | void set_size(size_t rc) { _rc = rc; _data.resize(_rc * _rc); ... method get_size (line 18) | size_t get_size() const { return _rc; } function karger_graph (line 76) | karger_graph& karger_graph::merge_vertices(size_t u, size_t v) method set (line 14) | void set(size_t r, size_t c, size_t d) { _data[(r * _rc) + c] = d;... method get (line 15) | size_t get(size_t r, size_t c) const { return _data[(r * _rc) + c]; } method set_size (line 17) | void set_size(size_t rc) { _rc = rc; _data.resize(_rc * _rc); ... method get_size (line 18) | size_t get_size() const { return _rc; } function random_contraction_algorithm (line 99) | void random_contraction_algorithm(karger_graph& km) function istream (line 127) | istream& operator>>(istream& is, karger_graph& km) function ostream (line 149) | ostream& operator<<(ostream& os, const karger_graph& km) function main (line 168) | int main(int argc, char* argv[]) FILE: Algorithms/Graph/Kosarajus_Algorithm/kosajaru.rs type Node (line 3) | type Node = usize; type Graph (line 4) | type Graph = Vec>; type Stack (line 5) | type Stack = Vec; function main (line 9) | fn main() { function kosajaru (line 50) | fn kosajaru(graph : Graph, n_nodes : usize) -> Vec { function reverse_graph (line 85) | fn reverse_graph(graph : &Graph) -> Graph{ function dfs_traversal (line 106) | fn dfs_traversal(graph : &Graph, v : Node, memo : &mut Vec, stack ... function dfs_color (line 119) | fn dfs_color(graph : &Graph, v : Node, memo : &mut Vec, color : us... FILE: Algorithms/Graph/Kosarajus_Algorithm/kosaraju.ts class Graph (line 3) | class Graph { method constructor (line 6) | constructor(vertices: number) { method addEdge (line 14) | addEdge(v: number, w: number): void { method printSCCs (line 18) | printSCCs(): void { method fillOrder (line 46) | fillOrder(v: number, visited: boolean[], stack: number[]): void { method getTranspose (line 62) | getTranspose(): Graph { method DFSUtil (line 74) | DFSUtil(v: number, visited: boolean[]): string { FILE: Algorithms/Graph/Kosarajus_Algorithm/kosaraju_algorithm_strongly_connected_components.cpp function init (line 4) | void init() { function dfs (line 11) | void dfs(vector graph[], int node, bool *visited, vector &orde... function dfs2 (line 22) | void dfs2(vector rev_graph[], int node, bool *visited) { function solve (line 31) | void solve(vector graph[], vector rev_graph[], int V) { function main (line 56) | int main() { FILE: Algorithms/Graph/Kruskal's_MST/KruskalMST.c type Edge (line 15) | typedef struct Edge{ type EdgeList (line 20) | typedef struct EdgeList{ function SortEdges (line 32) | void SortEdges(){ function FindVertexSet (line 49) | int FindVertexSet(int vertexSet[], int vertexNo){ function Union (line 57) | void Union(int vertexSet[], int srcNode, int destNode){ function KruskalMST (line 68) | void KruskalMST(){ function PrintResult (line 113) | void PrintResult(){ function main (line 131) | void main(){ FILE: Algorithms/Graph/Kruskal's_MST/Kruskal_Algorithm.cpp class Graph (line 8) | class Graph { function main (line 71) | int main() { FILE: Algorithms/Graph/Kruskal's_MST/cpp/kruskal.cpp function main (line 60) | int main() { function disjoint_set (line 97) | disjoint_set create_set(int n) { function get_parent (line 111) | int get_parent(disjoint_set &s, int i) { function set_union (line 128) | void set_union(disjoint_set &s, int u, int v) { function contains (line 141) | bool contains(disjoint_set &s, int u, int v) { function kruskal (line 150) | vector kruskal(vector graph, const int n_nodes) { FILE: Algorithms/Graph/Kruskal's_MST/python/KruskalMST.py function takeInput (line 4) | def takeInput(): class Graph (line 20) | class Graph: method __init__ (line 21) | def __init__(self, vertices,graph ): method find (line 31) | def find(self, parent, i): method union (line 42) | def union(self, parent, rank, x, y): method KruskalMST (line 66) | def KruskalMST(self): FILE: Algorithms/Graph/Kruskal's_MST/rust/kruskal.rs type DisjointSet (line 5) | struct DisjointSet { method new (line 75) | fn new(n_nodes : usize) -> DisjointSet { method get_parent (line 92) | fn get_parent(&mut self, i : usize) -> usize { method union (line 109) | fn union(&mut self, u : usize, v : usize) { method contains (line 122) | fn contains(&mut self, u : usize, v : usize) -> bool { type Edge (line 12) | struct Edge { method new (line 58) | fn new(weight : i32, u : usize, v : usize) -> Edge { type Graph (line 23) | type Graph = vec::Vec; function main (line 25) | fn main() { function kruskal (line 145) | fn kruskal(mut graph : Graph, n_nodes : usize) -> Graph { FILE: Algorithms/Graph/Level order traversal.cpp type node (line 4) | struct node{ function node (line 9) | node* newnode(ll int data) function levelorder (line 19) | void levelorder(node* root) function node (line 34) | node* inser(node* root,int data) function main (line 50) | int main() FILE: Algorithms/Graph/Lowest_Common_Manager/Lowest_Common_Manager.py function getLowestCommonManager (line 5) | def getLowestCommonManager(topManager, reportOne, reportTwo): function getOrgInfo (line 9) | def getOrgInfo(manager, reportOne, reportTwo): class OrgInfo (line 22) | class OrgInfo: method __init__ (line 23) | def __init__(self, lcm, numIP): class OrgChart (line 30) | class OrgChart: method __init__ (line 31) | def __init__(self, name): FILE: Algorithms/Graph/Prim's_MST/Prims_MST.java class Node (line 7) | class Node { method Node (line 12) | Node (int node, int cost) { class Prims_MST (line 18) | public class Prims_MST { method Find_MST (line 20) | public static int Find_MST(int source_node, List> graph) { method main (line 60) | public static void main(String args[]) { FILE: Algorithms/Graph/Tarjan's Algorithm/StronglyConnectedComponents.cpp function DFS (line 7) | void DFS(int u, vector adj[], stack &st) function tarjans (line 45) | vector> tarjans(int V, vector adj[]) function main (line 64) | int main() FILE: Algorithms/Graph/Topological Sort/topo_sort.py function topologicalSort (line 6) | def topologicalSort(jobs, deps): function createJobGraph (line 11) | def createJobGraph(jobs, deps): function getOrderedJobs (line 18) | def getOrderedJobs(graph): function dft (line 29) | def dft(node, orderedJobs): class JobGraph (line 45) | class JobGraph: method __init__ (line 46) | def __init__(self, jobs): method addNode (line 52) | def addNode(self, job): method getNode (line 56) | def getNode(self, job): method addPrereq (line 61) | def addPrereq(self, job, prereq): method __init__ (line 110) | def __init__(self, jobs): method addNode (line 116) | def addNode(self, job): method addDep (line 120) | def addDep(self, job, dep): method getNode (line 126) | def getNode(self, job): class JobNode (line 67) | class JobNode: method __init__ (line 68) | def __init__(self, job): method __init__ (line 133) | def __init__(self, job): function topologicalSort (line 78) | def topologicalSort(jobs, deps): function createJobGraph (line 83) | def createJobGraph(jobs, deps): function getOrderedJobs (line 90) | def getOrderedJobs(graph): function removeDeps (line 101) | def removeDeps(node, nwnp): class JobGraph (line 109) | class JobGraph: method __init__ (line 46) | def __init__(self, jobs): method addNode (line 52) | def addNode(self, job): method getNode (line 56) | def getNode(self, job): method addPrereq (line 61) | def addPrereq(self, job, prereq): method __init__ (line 110) | def __init__(self, jobs): method addNode (line 116) | def addNode(self, job): method addDep (line 120) | def addDep(self, job, dep): method getNode (line 126) | def getNode(self, job): class JobNode (line 132) | class JobNode: method __init__ (line 68) | def __init__(self, job): method __init__ (line 133) | def __init__(self, job): FILE: Algorithms/Graph/Topological sort/Topological_sort.cpp function check (line 12) | bool check(int V, vector &res, vector adj[]) { function main (line 26) | int main() { function dfs (line 56) | void dfs(int s,vector adj[]) function topoSort (line 68) | vector topoSort(int V, vector adj[]) { FILE: Algorithms/Graph/Youngest_Common_Ancestor/YoungerCommonAncestor.cpp type Node (line 9) | struct Node type Node (line 12) | struct Node function Node (line 16) | Node * newNode(int k) type Node (line 12) | struct Node function findPath (line 26) | bool findPath(Node *root, vector &path, int k) function findLCA (line 52) | int findLCA(Node *root, int n1, int n2) function main (line 71) | int main() FILE: Algorithms/Graph/Youngest_Common_Ancestor/YoungestCommonAncestor.java class YoungestCommonAncestor (line 1) | public class YoungestCommonAncestor { method main (line 10) | public static void main(String[] args) { method findYoungestCommon (line 26) | static boolean findYoungestCommon(TreeNode node, int val1, int val2) { method insert (line 43) | static TreeNode insert(int index) { method inOrder (line 56) | static void inOrder(TreeNode root) { class TreeNode (line 67) | static class TreeNode { method TreeNode (line 72) | public TreeNode(int val) { class NodeWrap (line 77) | static class NodeWrap { method NodeWrap (line 80) | public NodeWrap(TreeNode treeNode) { FILE: Algorithms/Graph/Youngest_Common_Ancestor/youngest-comm-anc.py class AncestralTree (line 5) | class AncestralTree: method __init__ (line 6) | def __init__(self, name): function getYoungestCommonAncestor (line 11) | def getYoungestCommonAncestor(topAncestor, descendantOne, descendantTwo): function getDescDep (line 20) | def getDescDep(desc, top): function youngCommon (line 27) | def youngCommon(lowerDesc, higherDesc, diff): FILE: Algorithms/Graph/articulation_points.py class Graph (line 2) | class Graph: method __init__ (line 3) | def __init__(self,vertices): method addEdge (line 9) | def addEdge(self,u,v): method APUtil (line 14) | def APUtil(self,u, visited, ap, parent, low, disc): method AP (line 54) | def AP(self): FILE: Algorithms/Graph/flood_fill.py function floodFillUtil (line 4) | def floodFillUtil(screen, x, y, prevC, newC): function floodFill (line 20) | def floodFill(screen, x, y, newC): FILE: Algorithms/Graph/lagrange_interpolation.cpp function main (line 5) | int main() FILE: Algorithms/Graph/lowest_common_manager/lowest_common_manager.java class Employee (line 1) | public class Employee { method Employee (line 5) | Employee(String name) { method setManager (line 9) | public void setManager(Employee m) { method addReprotee (line 12) | public void addReprotee(Employee e) { method closestCommonManager2 (line 18) | static Employee closestCommonManager2(Employee a, Employee b) { method closestCommonManager (line 53) | static Employee closestCommonManager(Employee a, Employee b) { method toString (line 78) | public String toString() { FILE: Algorithms/Graph/newton_raphson_method.c function main (line 9) | void main() FILE: Algorithms/Hashing/Amicable/Amicable_Number.rb class AmicableNumber (line 1) | class AmicableNumber method are_amicables? (line 3) | def are_amicables?(number_1, number_2) method is_valid? (line 11) | def is_valid?(number) method sum_divisors_of (line 16) | def sum_divisors_of(number) method divisors_of (line 22) | def divisors_of(number) FILE: Algorithms/Hashing/Amicable/Amicable_Numbers..c function main (line 2) | int main(){ FILE: Algorithms/Hashing/Amicable/Amicable_Numbers.cpp function main (line 3) | int main(){ FILE: Algorithms/Hashing/Amicable/Amicable_Numbers.java class AmicableNum (line 8) | class AmicableNum{ method findAmicable (line 11) | boolean findAmicable(int num1, int num2){ method main (line 51) | public static void main(String[] args) { FILE: Algorithms/Hashing/Amicable/amicable.cs class AmicableNumbersCS (line 6) | public class AmicableNumbersCS { method AreAmicable (line 7) | public bool AreAmicable(int x, int y) method EqualsDivisorsOf (line 17) | private bool EqualsDivisorsOf(int x, int y) method GetDivisors (line 35) | private int[] GetDivisors(int n) FILE: Algorithms/Hashing/Amicable/amicable_numbers.php function sumOfDiv (line 2) | function sumOfDiv( $x) function isAmicable (line 20) | function isAmicable( $a, $b) FILE: Algorithms/Hashing/Amicable/amicable_numbers.py function sumOfDiv (line 5) | def sumOfDiv(x): function isAmbicle (line 19) | def isAmbicle(a, b): function countPairs (line 24) | def countPairs(arr,n): FILE: Algorithms/Hashing/Brick_Wall/Brick_wall.cpp class Solution (line 1) | class Solution method leastBricks (line 4) | int leastBricks(vector> &wall) FILE: Algorithms/Hashing/Chaining/chainingHashing.cpp type Node (line 5) | struct Node type Node (line 8) | struct Node function init (line 12) | void init() function add (line 22) | void add(int x, int h) function display (line 45) | void display(int mod) function get_hash (line 71) | int get_hash(int x, int mod) function find (line 80) | void find(int x, int h) function main (line 101) | int main(void) FILE: Algorithms/Hashing/Cuckoo_Hashing/Cuckoo_Hashing.cpp function fillTable (line 19) | void fillTable(){ function printTable (line 33) | void printTable(){ function getHashValue (line 66) | int getHashValue(int function, int key){ function getArrange (line 79) | void getArrange(int key, int hashTable, int currPosition, int n){ function cuckooFunction (line 124) | void cuckooFunction(int keys[], int n){ function main (line 142) | int main(){ FILE: Algorithms/Hashing/Cuckoo_Hashing/Cuckoo_Hashing.java class Cuckoo_Hashing (line 3) | class Cuckoo_Hashing method initTable (line 12) | static void initTable() method hash (line 19) | static int hash(int function, int key) method place (line 28) | static void place(int key, int tableID, int cnt, int n) method printTable (line 52) | static void printTable() method cuckoo (line 66) | static void cuckoo(int keys[], int n) method main (line 73) | public static void main(String[] args) FILE: Algorithms/Hashing/Divisible_Pair_Count/DivisiblePairCount.c function DivisiblePairsCount (line 4) | int DivisiblePairsCount(int arr[], int n) function main (line 16) | int main() FILE: Algorithms/Hashing/Divisible_Pair_Count/DivisiblePairCount.go function main (line 7) | func main() { FILE: Algorithms/Hashing/Divisible_Pair_Count/DivisiblePairCount.java class DivisiblePairCount (line 4) | class DivisiblePairCount{ method countDivisibles (line 6) | public static int countDivisibles(int arr[],int n) method main (line 22) | public static void main(String[] args) FILE: Algorithms/Hashing/Divisible_Pair_Count/DivisiblePairCount.py function DivisiblePairCount (line 1) | def DivisiblePairCount(arr, n) : FILE: Algorithms/Hashing/Divisible_Pair_Count/DivsiblePairCount.cpp function DivisiblePairsCount (line 7) | int DivisiblePairsCount(vector v, int n) function main (line 19) | int main() FILE: Algorithms/Hashing/Group_Anagrams/Group_Anagrams.cpp function groupAnagrams (line 7) | vector> groupAnagrams(vector &strs) function main (line 29) | int main() FILE: Algorithms/Hashing/Group_Anagrams/group_anagrams.js function groupAnagrams (line 1) | function groupAnagrams(stringValue) { FILE: Algorithms/Hashing/Open Addressing/doubleHashHashingTable.cpp type Entry (line 13) | struct Entry method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} type Entry (line 20) | struct Entry method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} type Entry (line 27) | struct Entry { method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} function hashFxn (line 33) | int hashFxn(int key) { function otherHashFxn (line 39) | int otherHashFxn(int key) { function doubleHash (line 45) | int doubleHash(int key, bool searching) { function putProber (line 82) | bool putProber(Entry entry, int key) { function searchingProber (line 90) | bool searchingProber(Entry entry, int key) { function display (line 96) | void display() { function rehash (line 112) | void rehash() { function add (line 132) | void add(int key) { function remove (line 144) | void remove(int key) { function addInfo (line 155) | void addInfo(int key) { function removalInfo (line 168) | void removalInfo(int key) { function main (line 181) | int main(void) { FILE: Algorithms/Hashing/Open Addressing/linearProbingHashTable.cpp type Entry (line 13) | struct Entry method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} type Entry (line 20) | struct Entry method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} type Entry (line 27) | struct Entry { method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} function hashFxn (line 33) | int hashFxn(int key) { function linearProbe (line 39) | int linearProbe(int key, bool searching) { function putProber (line 73) | bool putProber(Entry entry, int key) { function searchingProber (line 81) | bool searchingProber(Entry entry, int key) { function display (line 87) | void display() { function rehash (line 103) | void rehash() { function add (line 123) | void add(int key) { function remove (line 135) | void remove(int key) { function addInfo (line 146) | void addInfo(int key) { function removalInfo (line 159) | void removalInfo(int key) { function main (line 172) | int main(void) { FILE: Algorithms/Hashing/Open Addressing/quadraticProbingHashTable.cpp type Entry (line 13) | struct Entry method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} type Entry (line 20) | struct Entry method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} type Entry (line 27) | struct Entry { method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} function hashFxn (line 33) | int hashFxn(int key) { function quadraticProbe (line 39) | int quadraticProbe(int key, bool searching) { function putProber (line 78) | bool putProber(Entry entry, int key) { function searchingProber (line 86) | bool searchingProber(Entry entry, int key) { function Entry (line 92) | Entry find(int key) { method Entry (line 28) | explicit Entry(int key = notPresent) : key(key) {} function display (line 99) | void display() { function rehash (line 115) | void rehash() { function add (line 135) | void add(int key) { function remove (line 147) | void remove(int key) { function addInfo (line 158) | void addInfo(int key) { function removalInfo (line 171) | void removalInfo(int key) { function main (line 184) | int main(void) { FILE: Algorithms/Hashing/Recaman_Sequence/Recamans_Sequence.java class Sequence (line 7) | class Sequence{ method recamansSeq (line 10) | void recamansSeq(int n){ method main (line 45) | public static void main (String[] args) FILE: Algorithms/Hashing/Recaman_Sequence/recaman.py function recaman (line 1) | def recaman(n): FILE: Algorithms/Hashing/Recaman_Sequence/recaman_sequence.cpp function get_recaman_sequence (line 4) | int get_recaman_sequence(int n) function main (line 27) | int main() FILE: Algorithms/Hashing/Recaman_Sequence/recamans_sequence.cs class Program (line 5) | class Program method Main (line 7) | static void Main(string[] args) FILE: Algorithms/LinkedList/Floyd_Cylce_detection/floyd_cycle_detection.cpp type ListNode (line 4) | struct ListNode { function push (line 9) | void push(ListNode** head, int new_val) { function isCyclePresent (line 19) | int isCyclePresent(ListNode* head) { function main (line 43) | int main() { FILE: Algorithms/LinkedList/Floyd_Cylce_detection/floyd_cycle_detection.java class LinkedList (line 3) | class LinkedList { class Node (line 7) | class Node { method Node (line 10) | Node(int d) method push (line 18) | public void push(int new_data) method detectLoop (line 31) | boolean detectLoop() method main (line 50) | public static void main(String args[]) FILE: Algorithms/LinkedList/Floyd_Cylce_detection/floyd_cycle_detection.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, data): class LinkedList (line 6) | class LinkedList: method __init__ (line 7) | def __init__(self): method push (line 11) | def push(self, new_data): method printList (line 17) | def printList(self): method detectLoop (line 24) | def detectLoop(self): FILE: Algorithms/Matrix/Spiral-Matrix/Spiral-Matrix.cpp function isInBounds (line 8) | bool isInBounds(int i, int j) function isBlocked (line 15) | bool isBlocked(int matrix[R][C], int i, int j) function spirallyDFSTravserse (line 24) | void spirallyDFSTravserse(int matrix[R][C], int i, int j, function spirallyTraverse (line 84) | vector spirallyTraverse(int matrix[R][C]) function main (line 91) | int main() FILE: Algorithms/Merging-Interval/#999 merging_intervals.py function mergeIntervals (line 1) | def mergeIntervals(arr): FILE: Algorithms/Merging-Interval/Merging_Intervals.java class Merging_Intervals (line 5) | public class Merging_Intervals { method main (line 7) | public static void main(String args[]) { method merge (line 24) | public static int[][] merge(int[][] intervals) { FILE: Algorithms/Merging-Interval/merge_intervals.cpp type Interval (line 5) | struct Interval function myComp (line 11) | bool myComp(Interval interval1, Interval interval2) function mergeIntervals (line 18) | void mergeIntervals(Interval arr[], int n) function main (line 64) | int main() FILE: Algorithms/Merging-Interval/merge_intervals.js function mergeIntervals (line 10) | function mergeIntervals(arr) { FILE: Algorithms/Pattern-Searching/Binary_Search/search_in_2D_matrix.java class search_in_2D_matrix (line 1) | public class search_in_2D_matrix { method searchMatrix (line 2) | public static boolean searchMatrix(int[][] matrix, int target) { method main (line 16) | public static void main(String[] args) FILE: Algorithms/Pattern-Searching/Substring_Check/search.php function search (line 4) | function search($pat, $txt, $q) FILE: Algorithms/Queue/first_negative_integer_in_window.cpp function findd (line 27) | int findd(int low,int high,int a[]){ function main (line 33) | int main() { FILE: Algorithms/Queue/first_nonrepeating_char_in_stream.cpp function main (line 22) | int main(){ FILE: Algorithms/Queue/reversing a queue.cpp function Print (line 5) | void Print(queue& Queue) function reverseQueue (line 14) | void reverseQueue(queue& Queue) function main (line 28) | int main() FILE: Algorithms/Recursion/All_Subsets.c type Stack (line 10) | typedef struct _Stack{ function main (line 27) | int main(int argc, char const *argv[]){ function is_empty (line 40) | int is_empty(Stack *stack){ function push (line 44) | void push(Stack *stack, int value){ function pop (line 48) | int pop(Stack *stack){ function show_stack (line 52) | void show_stack(Stack *stack){ function set_value_seq (line 59) | void set_value_seq(Stack *stack, int start, int end){ function generate (line 64) | void generate(Stack *stack, int max){ FILE: Algorithms/Recursion/Combination_Sum/Combination_Sum.php function combinationalSum (line 9) | function combinationalSum(array $elements, int $target) function findCombination (line 39) | function findCombination(array $elements, int $target, array $combinatio... function printCombinations (line 64) | function printCombinations(array $combinations) FILE: Algorithms/Recursion/Combination_Sum/combination_sum.cpp function generatePermutation (line 5) | void generatePermutation(vector &arr, int target, int currSum, int ... function combinationSum (line 21) | vector> combinationSum(vector &candidates, int target) { function main (line 28) | int main() { FILE: Algorithms/Recursion/Factorial/Factorial.c function run (line 10) | int run(int value){ function main (line 15) | int main(int argc, char const *argv[]){ FILE: Algorithms/Recursion/Factorial/Factorial.cs class Factorial (line 5) | class Factorial { method checkFact (line 7) | public int checkFact(int n) { method Main (line 14) | static void Main(string[] args) { FILE: Algorithms/Recursion/Factorial/Factorial.go function fact (line 4) | func fact(n int) int { function main (line 11) | func main() { FILE: Algorithms/Recursion/Factorial/Factorial_Algorithm.cpp function main (line 6) | int main() // main function: the execution of the program starts from... function factorial (line 16) | int factorial(int n) // funtion definition function recursiveFactorial (line 32) | int recursiveFactorial(int n) { // takes int n, to calculate n! function main (line 47) | int main() { FILE: Algorithms/Recursion/Factorial/Factorial_Algorithm.py function factorial (line 13) | def factorial(n): FILE: Algorithms/Recursion/Factorial/factorial.js function factorial (line 1) | function factorial(n) { FILE: Algorithms/Recursion/Factorial/factorial.py function factorial (line 1) | def factorial(n): FILE: Algorithms/Recursion/Josephus/Josephus.c type person (line 4) | typedef struct person function findWinner (line 10) | int findWinner(int n, int k) function main (line 48) | int main() FILE: Algorithms/Recursion/Josephus/Josephus.cs class TEMP (line 3) | class TEMP { method josephus (line 5) | static int josephus(int n, int k) method Main (line 15) | public static void Main() FILE: Algorithms/Recursion/Josephus/Josephus.java class Josephus (line 3) | public class Josephus { method execute (line 4) | public static int execute(int n, int k) { method main (line 20) | public static void main(String[] args){ FILE: Algorithms/Recursion/Josephus/josephus.cpp function main (line 6) | int main() function Josephus (line 14) | int Josephus(int n, int k) FILE: Algorithms/Recursion/Keypadcodes.cpp function sub (line 4) | int sub(string s,string output[],string s1[]) function main (line 39) | int main() { FILE: Algorithms/Recursion/Permutation/Permutation.cs class Permutations (line 7) | class Permutations method SinglePermutations (line 9) | public static List SinglePermutations(string s) method GetPermutations (line 23) | private static void GetPermutations(string item, SortedSet has... FILE: Algorithms/Recursion/Permutation/Permutation.js function getPermutations (line 1) | function getPermutations(input) { FILE: Algorithms/Recursion/Permutation/Permutation.ts class Permutation (line 1) | class Permutation { method getPermutations (line 2) | getPermutations(input: string): string | string[] { FILE: Algorithms/Recursion/Permutation/Permutations_Recursion.cpp function permute (line 7) | void permute(string a, int l, int r) function main (line 22) | int main() FILE: Algorithms/Recursion/Permutation/Permutations_Recursion.py function convert (line 1) | def convert(a): function permutation (line 9) | def permutation(s): FILE: Algorithms/Searching/Binary-Search/Binary_Search_CubicRoot.cpp function f (line 8) | double f(double x){ function binsearch (line 12) | double binsearch(double l, double r) function main (line 24) | int main(){ FILE: Algorithms/Searching/Binary-Search/Koko_Eating_Bananas/KEB.java class KEB (line 5) | public class KEB method check (line 7) | public static boolean check(int p[],int h,int K) //check if bananas... method main (line 17) | public static void main(String args[])throws IOException FILE: Algorithms/Searching/Binary-Search/Koko_Eating_Bananas/Koko_Eating_Bananas.cpp function computeMinHours (line 6) | int computeMinHours(vector &piles, int speed) function computeMax (line 15) | int computeMax(vector &piles) function minEatingSpeed (line 23) | int minEatingSpeed(vector &piles, int H) function main (line 52) | int main() FILE: Algorithms/Searching/Binary-Search/Koko_Eating_Bananas/Koko_Eating_Bananas.py function min_rate (line 17) | def min_rate(pile,hrs): function banana_per_hour (line 23) | def banana_per_hour(pile,hrs): function main (line 44) | def main(): FILE: Algorithms/Searching/Binary-Search/Rotated-Sorted-Array-Search.cs class PairInSortedRotated (line 6) | class PairInSortedRotated method pairInSortedRotated (line 10) | static bool pairInSortedRotated(int []arr, method Main (line 46) | public static void Main () FILE: Algorithms/Searching/Binary-Search/Rotated-Sorted-Array-Search.js function rotatedSearch (line 1) | function rotatedSearch(arr, target) { FILE: Algorithms/Searching/Binary-Search/Rotated-Sorted-Array-Search.py function pivotedBinarySearch (line 1) | def pivotedBinarySearch(arr, n, key): function findPivot (line 23) | def findPivot(arr, low, high): function binarySearch (line 42) | def binarySearch(arr, low, high, key): FILE: Algorithms/Searching/Binary-Search/binarySearch.c function binarySearch (line 3) | int binarySearch(int arr[], int l, int r, int x) function main (line 28) | int main(void) FILE: Algorithms/Searching/Binary-Search/binarySearch.cpp function main (line 4) | int main() FILE: Algorithms/Searching/Binary-Search/binary_search.cpp function binarySearch (line 6) | int binarySearch(int arr[], int l,int r,int x) function main (line 31) | int main() FILE: Algorithms/Searching/Binary-Search/binary_search.java class Binary (line 2) | class Binary method Search (line 4) | int Search(int array[], int r, int l, int y) method main (line 17) | public static void main(String args[]) FILE: Algorithms/Searching/Binary-Search/binarysearch.java class Solution (line 1) | class Solution { method BinarySearch (line 3) | public int BinarySearch(int[] nums, int target) { FILE: Algorithms/Searching/Binary-Search/binarysearch.php function binarySearch (line 3) | function binarySearch(Array $arr, $x) FILE: Algorithms/Searching/Binary-Search/binarysearch.py function binarySearch (line 1) | def binarySearch (arr, l, r, x): FILE: Algorithms/Searching/Binary-Search/matrix_binary_search.py function searchMatrix (line 1) | def searchMatrix(matrix:list,target:int)->bool: FILE: Algorithms/Searching/Binary-Search/search_in_2d_matrix.cpp function searchMatrix (line 5) | bool searchMatrix(vector>& mat, int target) function main (line 36) | int main() FILE: Algorithms/Searching/Exponential-Search/exponential_search.cpp function expoSearch (line 39) | int expoSearch(int arr[], int n, int x) function binSearch (line 48) | int binSearch(int arr[], int l, int r, int x) function main (line 61) | int main(void) FILE: Algorithms/Searching/Exponential-Search/exponential_search.php function expoSearch (line 2) | function expoSearch($arr, $n, $x) function binSearch (line 11) | function binSearch($arr, $l, $r, $x) FILE: Algorithms/Searching/Exponential-Search/exponential_search.py function bin_search (line 1) | def bin_search(arr, x, low=0, high=None): function exp_search (line 16) | def exp_search(arr, x): FILE: Algorithms/Searching/Fibonacci-Search/Fibonacci_Search.cpp function min (line 7) | int min(int x, int y) { function fibMonaccianSearch (line 12) | int fibMonaccianSearch(int arr[], int x, int n) function main (line 72) | int main(void) FILE: Algorithms/Searching/Fibonacci-Search/Fibonacci_search.java class Fibonacci (line 4) | class Fibonacci method min (line 8) | public static int min(int x, int y) method fibMonaccianSearch (line 12) | public static int fibMonaccianSearch(int arr[], method main (line 73) | public static void main(String[] args) FILE: Algorithms/Searching/Fibonacci-Search/Fibonacci_search.php function fibMonaccianSearch (line 4) | function fibMonaccianSearch($arr, $x, $n) FILE: Algorithms/Searching/Fibonacci-Search/Fibonacci_search_in_C.c function min (line 5) | int min(int x, int y) { return (x<=y)? x : y; } function fibMonaccianSearch (line 8) | int fibMonaccianSearch(int arr[], int x, int n) function main (line 66) | int main(void) FILE: Algorithms/Searching/Fibonacci-Search/fibonacciSearch.py function FibonacciGenerator (line 5) | def FibonacciGenerator(n): function FibonacciSearch (line 14) | def FibonacciSearch(arr, x): FILE: Algorithms/Searching/Fibonacci-Search/fibonacci_search.c function min (line 5) | int min(int x, int y) { return (x<=y)? x : y; } function fibMonaccianSearch (line 8) | int fibMonaccianSearch(int arr[], int x, int n) function main (line 66) | int main(void) FILE: Algorithms/Searching/Fibonacci-Search/fibonacci_search.js function fibonacciSearch (line 12) | function fibonacciSearch(n, arr, x){ FILE: Algorithms/Searching/Interpolation-Search/IS.cpp function interpolationSearch (line 3) | int interpolationSearch(int array[], int start, int end, int key) { function main (line 21) | int main() { FILE: Algorithms/Searching/Interpolation-Search/IS.py function intpolsearch (line 1) | def intpolsearch(values,x ): FILE: Algorithms/Searching/Jump-Search/JumpSearch.java class JumpSearch (line 2) | public class JumpSearch method jumpSearch (line 4) | public static int jumpSearch(int[] arr, int x) method main (line 42) | public static void main(String [ ] args) FILE: Algorithms/Searching/Jump-Search/Jump_Search.cpp function jumpSearch (line 6) | int jumpSearch(int arr[], int x, int n) function main (line 41) | int main() FILE: Algorithms/Searching/Jump-Search/jumpSearch.cs class MainClass (line 5) | class MainClass { method Main (line 6) | public static void Main (string[] args) { FILE: Algorithms/Searching/Jump-Search/jumpSearch.go function main (line 8) | func main() { function jumpSearch (line 20) | func jumpSearch(arr []int, x int, n int) (inx float64){ FILE: Algorithms/Searching/Jump-Search/jump_search.py function jumpSearch (line 3) | def jumpSearch( arr , x , n ): FILE: Algorithms/Searching/Linear-Search/LINEAR_SEARH.cpp function main (line 4) | int main() FILE: Algorithms/Searching/Linear-Search/LinearSearch.js function linearSearch (line 3) | function linearSearch(arr, ele) { FILE: Algorithms/Searching/Linear-Search/Linear_Search.cpp function main (line 4) | int main(){ FILE: Algorithms/Searching/Linear-Search/Linear_Search.go function LinearSearch (line 9) | func LinearSearch(array []int, target int) bool { function main (line 19) | func main() { FILE: Algorithms/Searching/Linear-Search/Linear_Search.py function LinearSearch (line 4) | def LinearSearch(arr, element): FILE: Algorithms/Searching/Linear-Search/Linearsearch.c function main (line 8) | void main() FILE: Algorithms/Searching/Linear-Search/linear_search.java class Search (line 1) | class Search method Linear (line 3) | public static int Linear (int array[], int num) method main (line 13) | public static void main(String args[]) FILE: Algorithms/Searching/Sublist-Search/Sublist_Search.php class Node (line 3) | class Node { function createNewNode (line 13) | function createNewNode (int $key) { function subListSearch (line 27) | function subListSearch(Node $first, Node $second): bool function printList (line 70) | function printList(Node $node) function testSubListSearch (line 82) | function testSubListSearch() FILE: Algorithms/Searching/Sublist-Search/sublist_search.cpp type Node (line 38) | struct Node function findList (line 43) | bool findList(Node* first, Node* second) function printList (line 72) | void printList(Node* node) function Node (line 80) | Node *newNode(int key) function main (line 87) | int main() FILE: Algorithms/Searching/Sublist-Search/sublist_search.cs class GFG (line 10) | class GFG class Node (line 14) | class Node method findList (line 22) | static Boolean findList(Node first, method printList (line 83) | static void printList(Node node) method newNode (line 93) | static Node newNode(int key) method Main (line 102) | public static void Main(String[] args) FILE: Algorithms/Searching/Sublist-Search/sublist_search.java class GFG (line 2) | class GFG class Node (line 4) | static class Node method findList (line 9) | static boolean findList(Node first, Node second) method printList (line 37) | static void printList(Node node) method newNode (line 45) | static Node newNode(int key) method main (line 52) | public static void main(String[] args) FILE: Algorithms/Searching/Sublist-Search/sublist_search.js class node (line 1) | class node { method constructor (line 2) | constructor(value) { FILE: Algorithms/Searching/Sublist-Search/sublist_search.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, value = 0): function findList (line 5) | def findList(first, second): FILE: Algorithms/Searching/Ternary-Search/Ternary-String.c function ll (line 26) | ll max(ll i,ll j){ function main (line 30) | int main(){ FILE: Algorithms/Searching/Ternary-Search/ternarySearch.cpp function ternarySearch (line 5) | int ternarySearch(int l, int r, int key, int ar[]) function main (line 43) | int main() FILE: Algorithms/Searching/Ternary-Search/unimodal_func.cpp function func1 (line 14) | double func1(double x){ function func2 (line 19) | double func2(double x){ function find_maxima (line 38) | double find_maxima(double l, double r){ function find_minima (line 67) | double find_minima(double l, double r){ function main (line 81) | int main(){ FILE: Algorithms/Searching/Ternary-Search/unimodal_func.java class TernarySearch (line 8) | public class TernarySearch method func1 (line 12) | public static double func1(double x){ method func2 (line 17) | public static double func2(double x){ method find_maxima (line 35) | public static double find_maxima(double l, double r){ method find_minima (line 64) | public static double find_minima(double l, double r){ method main (line 80) | public static void main(String args[]){ FILE: Algorithms/Searching/Ternary-Search/unimodal_func.js constant PRECISION (line 2) | const PRECISION = 0.0000001 function func1 (line 11) | function func1(x) { function func2 (line 16) | function func2(x) { function find_maxima (line 35) | function find_maxima(l, r) { function find_minima (line 64) | function find_minima(l, r) { FILE: Algorithms/Searching/Ternary-Search/unimodal_func.py function func1 (line 11) | def func1(x): function func2 (line 16) | def func2(x): function find_maxima (line 35) | def find_maxima(l,r): function find_minima (line 63) | def find_minima(l,r): function main_func (line 76) | def main_func(): FILE: Algorithms/Searching/Trie-Search/Trie Data Structure.cpp class Node (line 4) | class Node{ method Node (line 9) | Node(char d){ class Trie (line 14) | class Trie{ method Trie (line 19) | Trie(){ method insert (line 23) | void insert(char *w){ method find (line 38) | bool find(char *w){ function main (line 53) | int main(){ FILE: Algorithms/Searching/Trie-Search/Trie1_HashMap.java class Trie1_HashMap (line 4) | public class Trie1_HashMap{ method main (line 6) | public static void main(String[] args) { class TrieNode (line 19) | class TrieNode{ method TrieNode (line 24) | public TrieNode(char data,boolean terminate) { class Trie (line 31) | class Trie{ method Trie (line 34) | public Trie() { method search (line 38) | public boolean search(String s) { method display (line 53) | public void display() { method display (line 57) | private void display(TrieNode root) { method insert (line 68) | public void insert(String data) { method insert (line 72) | private void insert(TrieNode root, String s) { FILE: Algorithms/Searching/Trie-Search/TrieDataStructure.java class TrieDataStructure (line 5) | public class TrieDataStructure { class TrieNode (line 8) | static class TrieNode method TrieNode (line 14) | TrieNode(){ method insert (line 23) | static void insert(String key) method search (line 43) | static boolean search(String key) method main (line 64) | public static void main(String args[]) FILE: Algorithms/Searching/Trie-Search/Trie_Search.cpp type Trie (line 8) | struct Trie type Trie (line 11) | struct Trie type Trie (line 15) | struct Trie type Trie (line 11) | struct Trie type Trie (line 17) | struct Trie type Trie (line 11) | struct Trie type Trie (line 17) | struct Trie type Trie (line 11) | struct Trie type Trie (line 17) | struct Trie type Trie (line 11) | struct Trie function insert (line 27) | void insert(struct Trie *head, char* str) function search (line 50) | int search(struct Trie* head, char* str) function haveChildren (line 76) | int haveChildren(struct Trie* curr) function deletion (line 86) | int deletion(struct Trie **curr, char* str) function main (line 138) | int main() FILE: Algorithms/Searching/Trie-Search/Trie_Search.go type Trie (line 9) | type Trie struct method Insert (line 26) | func (this *Trie) Insert(word string) { method Search (line 40) | func (this *Trie) Search(word string) bool { type trieNode (line 13) | type trieNode struct function Constructor (line 19) | func Constructor() Trie { function main (line 56) | func main() { FILE: Algorithms/Searching/Trie-Search/Trie_Search.py class TrieNode (line 4) | class TrieNode: method __init__ (line 5) | def __init__(self): class Trie (line 10) | class Trie: method __init__ (line 11) | def __init__(self): method getNode (line 14) | def getNode(self): method toIndex (line 17) | def toIndex(self, ch): method insert (line 21) | def insert(self, key): method search (line 33) | def search(self, key): function main (line 47) | def main(): FILE: Algorithms/Sorting/3-Way_Quick_Sort/3-Way_Quick_Sort.cpp function quick_sort_partition3 (line 19) | std::vector quick_sort_partition3(std::vector &arr, int low, i... function randomized_quick_sort (line 46) | void randomized_quick_sort(std::vector &arr, int low, int high) { function main (line 57) | int main() { FILE: Algorithms/Sorting/3-Way_Quick_Sort/3-Way_Quick_Sort.cs class Sort (line 4) | class Sort { method swap (line 6) | static void swap(ref T lhs, ref T rhs) method partition (line 14) | public static void partition(int[] a, int l, int r, ref int i, ref int j) method quicksort (line 63) | public static void quicksort(int[] a, int l, int r) method printarr (line 78) | public static void printarr(int[] a, int n) method Main (line 86) | static void Main() FILE: Algorithms/Sorting/3-Way_Quick_Sort/3-Way_Quick_Sort.java class QuickSort (line 5) | public class QuickSort { method swap (line 7) | private static void swap(Comparable[] arr, int first, int second) method quickSort3Way (line 15) | private static void quickSort3Way(Comparable[] arr, int low, int high) method printSortedArray (line 46) | private static void printSortedArray(Comparable[] arr) method main (line 53) | public static void main(String[] args) throws IOException FILE: Algorithms/Sorting/3-Way_Quick_Sort/3_Way_Quick_Sort.c function swap (line 4) | void swap(int &x, int &y) function partition (line 11) | void partition(int a[], int l, int r, int& i, int& j) function quicksort (line 47) | void quicksort(int a[], int l, int r) function printarr (line 57) | void printarr(int a[], int n) function main (line 64) | int main() FILE: Algorithms/Sorting/Bead_Sort/Bead_Sort.php function columns (line 2) | function columns($my_array) { function bead_sort (line 12) | function bead_sort($my_array) { FILE: Algorithms/Sorting/Bead_Sort/Bead_Sort.rb class Array (line 1) | class Array method beadsort (line 2) | def beadsort method columns (line 6) | def columns FILE: Algorithms/Sorting/Bead_Sort/Bead_sort.cpp function beadSort (line 3) | void beadSort(int *a, int len) function main (line 36) | int main() FILE: Algorithms/Sorting/Bead_Sort/bead_sort.py function bead_sort (line 1) | def bead_sort(obj): FILE: Algorithms/Sorting/Binary_Insertion_Sort/Binary Insertion Sort.c function binarySearch (line 7) | int binarySearch(int a[], int item, int low, int high) function insertionSort (line 23) | void insertionSort(int a[], int n) function main (line 46) | int main() FILE: Algorithms/Sorting/Binary_Insertion_Sort/Binary_Insertion_Sort.cpp function binarySearch (line 4) | int binarySearch(int a[], int item, int low, int high) function insertionSort (line 20) | void insertionSort(int a[], int n) function main (line 42) | int main() FILE: Algorithms/Sorting/Binary_Insertion_Sort/Binary_Insertion_Sort.py function binsertion_sort (line 3) | def binsertion_sort(arr): FILE: Algorithms/Sorting/Bitonic_Search/BitonicSort.java class BitonicSort (line 2) | public class BitonicSort method merge (line 11) | void merge(int a[], int low, int cnt, int arr) method swap (line 27) | void swap(int a[], int i, int j, int arr) method bitonicSort (line 43) | void bitonicSort(int a[], int low, int cnt, int arr) method sort (line 63) | void sort(int a[], int N, int up) method printArray (line 69) | static void printArray(int arr[]) method main (line 78) | public static void main(String args[]) FILE: Algorithms/Sorting/Bitonic_Search/Bitonic_sort.c function compAndSwap (line 9) | void compAndSwap(int a[], int i, int j, int dir) function bitonicMerge (line 19) | void bitonicMerge(int a[], int low, int cnt, int dir) function bitonicSort (line 34) | void bitonicSort(int a[],int low, int cnt, int dir) function sort (line 54) | void sort(int a[], int N, int up) function main (line 60) | int main() FILE: Algorithms/Sorting/Bitonic_Search/bitonic_search.py function compAndSwap (line 1) | def compAndSwap(a, i, j, dire): function bitonic_merge (line 5) | def bitonic_merge(a, low, cnt, dire): function bitonic_sort (line 13) | def bitonic_sort(a, low, cnt, dire): function sort (line 20) | def sort(a, N, up): FILE: Algorithms/Sorting/Brick_Sort/BrickSort.js function swap (line 4) | function swap(arr, first_Index, second_Index) { function brickSort (line 11) | function brickSort(arr) { FILE: Algorithms/Sorting/Brick_Sort/Brick_Sort.c function oddEvenSort (line 6) | void oddEvenSort(int arr[], int n) function printArray (line 39) | void printArray(int arr[], int n) function main (line 47) | int main() FILE: Algorithms/Sorting/Brick_Sort/brickSort.py function brickSort (line 1) | def brickSort(array, n): FILE: Algorithms/Sorting/Bubble_Sort/BubbleSort.js function swap (line 1) | function swap(arr, first_Index, second_Index) { function bubbleSort (line 7) | function bubbleSort(arr) { FILE: Algorithms/Sorting/Bubble_Sort/Bubble_Sort.c function main (line 3) | int main() FILE: Algorithms/Sorting/Bubble_Sort/Bubble_Sort.cs class MySort (line 3) | class MySort { method Main (line 4) | static void Main(string[] args) { FILE: Algorithms/Sorting/Bubble_Sort/Bubble_sort_optimised.cpp function swap (line 6) | void swap(int *xp, int *yp) function bubbleSort (line 14) | void bubbleSort(int arr[], int n) function printArray (line 37) | void printArray(int arr[], int size) function main (line 46) | int main() FILE: Algorithms/Sorting/Bubble_Sort/bubbleSort.cpp function bubble_sort (line 4) | void bubble_sort(int arr[],int n) function main (line 17) | int main() FILE: Algorithms/Sorting/Bubble_Sort/bubble_sort.java class Bubble (line 1) | class Bubble method Sort (line 3) | void Sort(int array[]) method printarrayay (line 18) | void printarrayay(int array[])//to print the array method main (line 26) | public static void main(String args[]) FILE: Algorithms/Sorting/Bucket_Sort/BucketSort.c type Node (line 10) | struct Node { type Node (line 16) | struct Node type Node (line 16) | struct Node type Node (line 18) | struct Node function BucketSort (line 22) | void BucketSort(int arr[]) { type Node (line 78) | struct Node type Node (line 78) | struct Node type Node (line 79) | struct Node type Node (line 88) | struct Node type Node (line 90) | struct Node type Node (line 104) | struct Node function getBucketIndex (line 120) | int getBucketIndex(int value) { function print (line 124) | void print(int ar[]) { function printBuckets (line 133) | void printBuckets(struct Node *list) { function main (line 142) | int main(void) { FILE: Algorithms/Sorting/Bucket_Sort/BucketSort.java class BucketSort (line 7) | public class BucketSort { method bucketSort (line 8) | public void bucketSort(float[] arr, int n) { method main (line 39) | public static void main(String[] args) { FILE: Algorithms/Sorting/Bucket_Sort/BucketSort.py function bucket_sort (line 1) | def bucket_sort(input_list): FILE: Algorithms/Sorting/Bucket_Sort/bucket_sort.cpp function bucketSort (line 7) | void bucketSort(float arr[], int n) function main (line 24) | int main() FILE: Algorithms/Sorting/Bucket_Sort/bucketsort.php function insertion_sort (line 2) | function insertion_sort(&$elements, $fn = 'comparison_function') { function comparison_function (line 15) | function comparison_function(&$a, &$b) { function bucket_sort (line 19) | function bucket_sort(&$elements) { FILE: Algorithms/Sorting/Bucket_Sort/bucketsort.rb function bucket_sort (line 7) | def bucket_sort(arr, n, buckets, m) FILE: Algorithms/Sorting/Bucket_Sort/bucketsortinC.c function Bucket_Sort (line 7) | void Bucket_Sort(int array[], int n) function main (line 24) | int main() FILE: Algorithms/Sorting/Circle_Sort/Circle_Sort.c function circle_sort_inner (line 4) | int circle_sort_inner(int *start, int *end) function circle_sort (line 16) | void circle_sort(int a[], int n) function main (line 24) | int main(void) FILE: Algorithms/Sorting/Circle_Sort/Circle_Sort.cs class Program (line 4) | class Program method Main (line 9) | public static void Main() method CircleSort (line 22) | public static void CircleSort(int[] array) method CircleSort (line 38) | private static bool CircleSort(int[] array, int lowIndex, int highIndex) FILE: Algorithms/Sorting/Circle_Sort/Circle_Sort.java class circleSortClass (line 2) | class circleSortClass method circleSortInner (line 4) | boolean circleSortInner(int a[], int low, int high) method circleSort (line 34) | void circleSort (int a[], int n) method swap (line 40) | void swap(int arr[],int l,int h) method main (line 50) | public static void main(String[] args) FILE: Algorithms/Sorting/Circle_Sort/Circle_Sort.rb class Array (line 1) | class Array method circle_sort! (line 2) | def circle_sort! method _circle_sort! (line 10) | def _circle_sort!(lo, hi, swaps=0) FILE: Algorithms/Sorting/Cocktail_Sort/Cocktail_Sort.c function swap (line 5) | void swap(int *a, int *b){ function CocktailSort (line 12) | void CocktailSort(int a[], int n) function printArray (line 46) | void printArray(int a[], int n) function main (line 55) | int main() FILE: Algorithms/Sorting/Cocktail_Sort/Cocktail_Sort.cpp function cocktailSort (line 3) | void cocktailSort(int arr[], int n){ function main (line 28) | main() {int n; FILE: Algorithms/Sorting/Cocktail_Sort/Cocktail_Sort.java class Cocktailsort (line 4) | public class Cocktailsort { method cocktailsort (line 5) | void cocktailsort(int l[], int n) { method printArray (line 50) | void printArray(int a[]) { method main (line 57) | public static void main(String[] args) { FILE: Algorithms/Sorting/Cocktail_Sort/Cocktail_Sort.py function cocktailsort (line 3) | def cocktailsort(l): FILE: Algorithms/Sorting/Comb_Sort/Comb_Sort.c function newGap (line 5) | int newGap(int gap) { function combsort (line 13) | void combsort(int a[], int aSize) { function main (line 31) | int main() FILE: Algorithms/Sorting/Comb_Sort/Comb_Sort.cpp function display (line 4) | void display(int *array, int size){ function combSort (line 9) | void combSort(int *array, int size){ function main (line 25) | int main(){ FILE: Algorithms/Sorting/Comb_Sort/comb.py function getNextGap (line 1) | def getNextGap(gap): function combSort (line 7) | def combSort(array_to_sort): FILE: Algorithms/Sorting/Comb_Sort/comb_sort.rb function comb_sort (line 2) | def comb_sort(arr) FILE: Algorithms/Sorting/Counting_Sort/Count_sort.py function count_sort (line 7) | def count_sort(ls): FILE: Algorithms/Sorting/Counting_Sort/Counting_Sort.c function countSort (line 4) | void countSort(int arr[], int len) function main (line 30) | int main() FILE: Algorithms/Sorting/Counting_Sort/Counting_Sort.cs class Program (line 3) | class Program method CountingSort (line 8) | public static int[] CountingSort(int[] arrayToSort) method Main (line 52) | static void Main() method ExitAfterInvalidInput (line 85) | private static void ExitAfterInvalidInput() FILE: Algorithms/Sorting/Counting_Sort/Counting_Sort.java class Counting_Sort (line 6) | class Counting_Sort method main (line 8) | public static void main(String[] args) { FILE: Algorithms/Sorting/Counting_Sort/Counting_sort.js function counting_sort (line 1) | function counting_sort(arrin) { FILE: Algorithms/Sorting/Counting_Sort/counting_sort.py function countingSort (line 1) | def countingSort(array): FILE: Algorithms/Sorting/Counting_Sort/countingsort.py function countSort (line 1) | def countSort(arr): FILE: Algorithms/Sorting/Cycle_Sort/CYCLESort.cs class GFG (line 5) | class GFG { method cycleSort (line 11) | public static void cycleSort(int[] arr, int n) method Main (line 133) | public static void Main() FILE: Algorithms/Sorting/Cycle_Sort/Cyclesort.py function cycleSort (line 1) | def cycleSort(array): FILE: Algorithms/Sorting/Cycle_Sort/cyclesort.c function cycleSort (line 1) | void cycleSort(int arr[], int n) function main (line 59) | int main() FILE: Algorithms/Sorting/Cycle_Sort/stoogesort.java class stooge (line 3) | public class stooge { method stoogesort (line 5) | static void stoogesort(int arr[], int l, int h) method main (line 29) | public static void main(String args[]) FILE: Algorithms/Sorting/Gnome_Sort/Gnome_Sort.cs class GFG (line 4) | class GFG { method gnomeSort (line 6) | static void gnomeSort(int[] arr, int n) method Main (line 28) | public static void Main() FILE: Algorithms/Sorting/Gnome_Sort/Gnome_Sort.java class GFG (line 4) | public class GFG { method gnomeSort (line 5) | static void gnomeSort(int arr[], int n) method main (line 26) | public static void main(String[] args) FILE: Algorithms/Sorting/Gnome_Sort/Gnome_Sort.php function gnomeSort (line 7) | function gnomeSort($arr, $n) FILE: Algorithms/Sorting/Gnome_Sort/Gnome_Sort.py function gnomeSort (line 4) | def gnomeSort( arr, n): FILE: Algorithms/Sorting/Gnome_Sort/gnomeSort.java class gnomeSort (line 3) | class gnomeSort { method gnomeSort (line 4) | void gnomeSort(int[] nums) method main (line 23) | public static void main(String args[]) FILE: Algorithms/Sorting/Heap_Sort/Max_heap_sort.cpp function downadj (line 12) | void downadj(int heap[],int i,int n) //down adjust function show (line 31) | void show(int arr[],int n,int x) //print array function upadj (line 51) | void upadj(int heap[],int i) //up adjust function insert (line 60) | void insert(int a[],int x) //construct max heap (Step 1) function main (line 83) | int main() FILE: Algorithms/Sorting/Heap_Sort/heap-sort.c function swap (line 3) | void swap(int *a, int *b) function heapify (line 11) | void heapify(int arr[], int n, int i) function heapSort (line 31) | void heapSort(int arr[], int n) function printArray (line 44) | void printArray(int arr[], int n) function main (line 52) | int main() FILE: Algorithms/Sorting/Heap_Sort/heap-sort.php function build_heap (line 2) | function build_heap(&$array, $i, $t){ function heap_sort (line 22) | function heap_sort(&$array) { FILE: Algorithms/Sorting/Heap_Sort/heap-sort.py function heapify (line 17) | def heapify(arr, n, index): function heapSort (line 40) | def heapSort(arr): FILE: Algorithms/Sorting/Heap_Sort/heap-sort.rb function heap_sort (line 1) | def heap_sort(array) function heapify (line 21) | def heapify(a, parent, limit) FILE: Algorithms/Sorting/Heap_Sort/heap_sort.cpp function heapify (line 6) | void heapify(int arr[], int n, int i) { function heapSort (line 22) | void heapSort(int arr[], int n) { function printArray (line 31) | void printArray(int arr[], int n) { function main (line 37) | int main() { FILE: Algorithms/Sorting/Heap_Sort/heap_sort.go function heapify (line 5) | func heapify(array []int, n, i int) { function HeapSort (line 24) | func HeapSort(array []int, n int) { function main (line 34) | func main() { FILE: Algorithms/Sorting/Heap_Sort/heap_sort.java class HeapSort (line 2) | public class HeapSort method sort (line 4) | public void sort(int arr[]) method heapify (line 21) | void heapify(int arr[], int n, int i) method printArray (line 43) | static void printArray(int arr[]) method main (line 51) | public static void main(String args[]) FILE: Algorithms/Sorting/Heap_Sort/heapsorting.py function heapify (line 1) | def heapify(arr, n, i): function heapSort (line 19) | def heapSort(arr): FILE: Algorithms/Sorting/Insertion_Sort/InsertSort.py function insertion_sort (line 1) | def insertion_sort(InputList): FILE: Algorithms/Sorting/Insertion_Sort/Insertion Sort.cpp function insertionSort (line 6) | void insertionSort(int arr[], int n) function printArray (line 27) | void printArray(int arr[], int n) function main (line 36) | int main() FILE: Algorithms/Sorting/Insertion_Sort/InsertionSort.java class InsertionSort (line 3) | class InsertionSort { method sort (line 5) | void sort(int arr[]) method printArray (line 21) | static void printArray(int arr[]) method main (line 31) | public static void main(String args[]) FILE: Algorithms/Sorting/Insertion_Sort/InsertionSort.py function insertionSort (line 1) | def insertionSort(arr): FILE: Algorithms/Sorting/Insertion_Sort/Insertion_Sort.cpp function insertionsort (line 4) | void insertionsort(int arr[],int len){ function main (line 15) | int main(){ FILE: Algorithms/Sorting/Insertion_Sort/Insertion_sort_2.cpp function Insertion_sort (line 4) | void Insertion_sort(int a[],int n){ function main (line 17) | int main(){ FILE: Algorithms/Sorting/Insertion_Sort/insertion_sort.py function insertion_sort (line 3) | def insertion_sort(a): FILE: Algorithms/Sorting/Insertion_Sort/insertion_sort.ts class InsertionSort (line 7) | class InsertionSort{ method constructor (line 10) | constructor(){ method sort (line 20) | public sort(arr:number[]):number[]{ FILE: Algorithms/Sorting/Merge_Sort/Application of Merge Sort/Count_Inversions.c function merge (line 4) | long long int merge(long long int a[], long long int start, long long i... function merge_sort (line 49) | long long int merge_sort(long long int a[],long long int start,long long... function main (line 73) | int main() FILE: Algorithms/Sorting/Merge_Sort/Application of Merge Sort/Count_Inversions.cpp function merge (line 4) | long long merge(long long a[], long long start, long long mid, long long... function merge_sort (line 49) | long long merge_sort(long long a[],long long start,long long end) function main (line 73) | int main() FILE: Algorithms/Sorting/Merge_Sort/MERGE_SORT.c function merging (line 9) | void merging(int low, int mid, int high) { function sort (line 30) | void sort(int low, int high) { function main (line 43) | int main() { FILE: Algorithms/Sorting/Merge_Sort/MERGE_SORT.cpp function merge (line 5) | void merge(int arr[], int p, int q, int r) function mergeSort (line 60) | void mergeSort(int arr[], int l, int r) { function printArray (line 74) | void printArray(int arr[], int size) { function main (line 81) | int main() { FILE: Algorithms/Sorting/Merge_Sort/MERGE_SORT.java class MergeSort (line 2) | class MergeSort { method merge (line 6) | void merge(int arr[], int l, int m, int r) method sort (line 58) | void sort(int arr[], int l, int r) method printArray (line 74) | static void printArray(int arr[]) method main (line 83) | public static void main(String args[]) FILE: Algorithms/Sorting/Merge_Sort/MERGE_SORT.js function mergeSort (line 1) | function mergeSort(array,half = array.length/2){ function merger (line 12) | function merger(left,right){ FILE: Algorithms/Sorting/Merge_Sort/Non_recursive_merge_sort.cpp function merge (line 6) | void merge(int *a, int size, int low, int high, int mid) function mergeSortIterative (line 46) | void mergeSortIterative(int* arr, int size, int low, int high) function main (line 70) | int main() FILE: Algorithms/Sorting/Merge_Sort/mergeSort.py function mergeSort (line 2) | def mergeSort(arr): function printList (line 35) | def printList(arr): FILE: Algorithms/Sorting/Merge_Sort/merge_Sort.rb function merge_sort (line 2) | def merge_sort(unsorted_array) function merge (line 15) | def merge(left_array, right_array) FILE: Algorithms/Sorting/Merge_Sort/non_recursive_merge_sort.c type Element (line 6) | struct Element{ // this is the structure of element t... type Stack (line 12) | struct Stack{ //Structure for Stack function IsEmpty (line 17) | int IsEmpty(struct Stack *stack){ function Push (line 24) | int Push(struct Stack *stack, struct Element val){ // val is of typ... function Top (line 30) | struct Element Top(struct Stack *stack){ function Pop (line 39) | struct Element Pop(struct Stack *stack){ function merge (line 53) | void merge(int* A,int* B, int n, int left, int mid, int right){ ... function merge_sort (line 85) | void merge_sort(int* A,int* B, int n){ //we will call this ... function main (line 113) | int main() { FILE: Algorithms/Sorting/Merge_Sort/non_recursive_merge_sort.cs class MS (line 3) | class MS { method mergeSort (line 4) | static void mergeSort(int[] arr, method merge (line 16) | static void merge(int[] arr, int l, method printArray (line 65) | static void printArray(int []A, int size) method Main (line 73) | public static void Main() FILE: Algorithms/Sorting/Merge_Sort/non_recursive_merge_sort.py function mergeSort (line 1) | def mergeSort(a): function merge (line 21) | def merge(a, l, m, r): FILE: Algorithms/Sorting/Merge_Sort_on_Doubly_Linked_List/Mergesort_doubly.c type Node (line 3) | struct Node type Node (line 9) | struct Node type Node (line 9) | struct Node type Node (line 12) | struct Node type Node (line 12) | struct Node type Node (line 12) | struct Node type Node (line 40) | struct Node type Node (line 40) | struct Node type Node (line 44) | struct Node function insert (line 56) | void insert(struct Node **head, int data) function print (line 74) | void print(struct Node *head) function swap (line 93) | void swap(int *A, int *B) type Node (line 102) | struct Node type Node (line 102) | struct Node type Node (line 104) | struct Node type Node (line 110) | struct Node function main (line 116) | int main(void) FILE: Algorithms/Sorting/Merge_Sort_on_Doubly_Linked_List/Mergesort_doubly.cpp class Node (line 3) | class Node function Node (line 11) | Node *merge(Node *first, Node *second) function Node (line 33) | Node *mergeSort(Node *head) function insert (line 43) | void insert(Node **head, int data) function print (line 58) | void print(Node *head) function swap (line 75) | void swap(int *A, int *B) function Node (line 81) | Node *split(Node *head) function main (line 94) | int main(void) FILE: Algorithms/Sorting/Merge_Sort_on_Doubly_Linked_List/Mergesort_doubly.java class LinkedList (line 1) | class LinkedList { class Node (line 4) | static class Node { method Node (line 9) | Node(int d) { method print (line 15) | void print(Node node) { method split (line 30) | Node split(Node head) { method mergeSort (line 41) | Node mergeSort(Node node) { method merge (line 53) | Node merge(Node first, Node second) { method main (line 72) | public static void main(String[] args) { FILE: Algorithms/Sorting/Merge_Sort_on_Doubly_Linked_List/Mergesort_doubly.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self,data): class DoubleLinkedList (line 7) | class DoubleLinkedList: method __init__ (line 8) | def __init__(self): method merge (line 11) | def merge(self,a,b): method mergesort (line 26) | def mergesort(self,head): method div (line 36) | def div(self,head): method insert (line 50) | def insert(self,d): method display (line 58) | def display(self,node): FILE: Algorithms/Sorting/Pancake_Sort/PancakeSort.java class PancakeSort (line 6) | public class PancakeSort { method main (line 8) | public static void main(String[] args) { method pancakeSort (line 13) | static int[] pancakeSort(int[] arr) { method flip (line 26) | public static void flip(int[] arr, int k) { method findGreatestElement (line 38) | public static int findGreatestElement(int[] arr, int start, int end) { FILE: Algorithms/Sorting/Pancake_Sort/Pancake_Sort.c function flip (line 5) | void flip(int arr[], int i) function findMax (line 19) | int findMax(int arr[], int n) function pancakeSort (line 29) | int pancakeSort(int *ar, int n) function main (line 51) | int main() FILE: Algorithms/Sorting/Pancake_Sort/Pancake_Sort.cs class Program (line 4) | class Program method Main (line 9) | public static void Main() method PancakeSort (line 26) | public static int[] PancakeSort(int[] array) method IndexOfMax (line 51) | private static int IndexOfMax(int[] array, int n) method Flip (line 70) | private static void Flip(int[] array, int end) FILE: Algorithms/Sorting/Pancake_Sort/Pancake_Sort.js function pancakeSort (line 1) | function pancakeSort(arr){ FILE: Algorithms/Sorting/Pancake_Sort/Pancake_Sort.py function pancake_sort (line 3) | def pancake_sort(nums): FILE: Algorithms/Sorting/Pancake_Sort/Pancake_Sort.rb class Array (line 1) | class Array method pancake_sort! (line 2) | def pancake_sort! FILE: Algorithms/Sorting/Patience_Sort/PatienceSort.cs class Program (line 7) | class Program method Main (line 10) | static void Main(string[] args) method PatienceSort (line 56) | static void PatienceSort(ref int[] numbers) FILE: Algorithms/Sorting/Patience_Sort/Patience_sort.cpp function main (line 59) | int main (void) //(int argC,char* argV[]) FILE: Algorithms/Sorting/Patience_sort.py function new_stack (line 4) | def new_stack(val): #create new stack function patience_sort (line 9) | def patience_sort(t,n): #gives sorted list FILE: Algorithms/Sorting/Pigeonhole_Sort/PigeonholeSort.cpp function pigeonholeSort (line 6) | void pigeonholeSort(int arr[], int n) function main (line 42) | int main() FILE: Algorithms/Sorting/Pigeonhole_Sort/Pigeonhole_Sort.c function pigeonhole_sort (line 5) | void pigeonhole_sort(int arr[], int num, int min, int max) function main (line 23) | int main() FILE: Algorithms/Sorting/Pigeonhole_Sort/Pigeonhole_Sort.java class Pigeonhole_Sort (line 4) | public class Pigeonhole_Sort method pigeonhole_sort (line 6) | public static void pigeonhole_sort(int arr[], method main (line 37) | public static void main(String[] args) FILE: Algorithms/Sorting/Pigeonhole_Sort/pigeonhole.py function pigeonhole_sort (line 1) | def pigeonhole_sort(a): FILE: Algorithms/Sorting/Quick_Select/QuickSelect.cpp class Solution (line 5) | class Solution { method findKthLargest (line 7) | int findKthLargest(vector& nums, int k) { method findKthLargest (line 11) | int findKthLargest(vector& nums, int left, int right ,int k) { method swap (line 28) | void swap( vector& A, int i, int j) { FILE: Algorithms/Sorting/Quick_Select/Quick_Select.js function partition (line 1) | function partition(array3, l, r){ function termFinder (line 16) | function termFinder(array1, l, r, k){ FILE: Algorithms/Sorting/Quick_Select/Quick_Select.php function kthSmallest (line 10) | function kthSmallest(array $list, int $kthPosition) { function quickSelect (line 30) | function quickSelect(array $list, int $low, int $high, int $kthIndex) { function partition (line 55) | function partition(array &$list, int $low, int $high) { FILE: Algorithms/Sorting/Quick_Select/Quick_select.py class Solution (line 3) | class Solution: method findKthLargest (line 4) | def findKthLargest(self, nums: 'List[int]', k: 'int') -> 'int': method findKthLargest (line 20) | def findKthLargest(self, nums: 'List[int]', k: 'int') -> 'int': FILE: Algorithms/Sorting/Quick_Select/quick_select.java class quick_select (line 1) | class quick_select { method kthLargest (line 2) | public int kthLargest(int[] arr, int k) { method partition (line 21) | private int partition(int[] arr, int left, int right, int pivotIndex) { method swap (line 38) | private void swap(int[] arr, int first, int second) { FILE: Algorithms/Sorting/Quick_Select/quick_select.rb function find_kth_largest (line 4) | def find_kth_largest(nums, k) function quick_select (line 9) | def quick_select(a, p, r, k) # Note the k here refers to (n -... function partition (line 22) | def partition(a, p, r) function rand_partition (line 36) | def rand_partition(a, p, r) FILE: Algorithms/Sorting/Quick_Sort/QuickSort.java class QuickSort (line 3) | class QuickSort method partition (line 7) | int partition(int arr[], int low, int high) method sort (line 34) | void sort(int arr[], int low, int high) method printArray (line 50) | static void printArray(int arr[]) method main (line 59) | public static void main(String args[]) FILE: Algorithms/Sorting/Quick_Sort/QuickSort.js function quickSort (line 1) | function quickSort(array) { // assumes an array of ints FILE: Algorithms/Sorting/Quick_Sort/QuickSort.py function partition (line 12) | def partition(arr,low,high): function quickSort (line 29) | def quickSort(arr,low,high): FILE: Algorithms/Sorting/Quick_Sort/Quick_Sort.cpp function swap (line 6) | void swap(int* a, int* b) function partition (line 13) | int partition (int arr[], int low, int high) function quickSort (line 31) | void quickSort(int arr[], int low, int high) function printArray (line 44) | void printArray(int arr[], int size) function main (line 53) | int main() FILE: Algorithms/Sorting/Quick_Sort/Quick_Sort.go function swap (line 5) | func swap(num1 *int, num2 *int) { function partition (line 12) | func partition(elements []int, low int, high int) int { function quickSort (line 28) | func quickSort(elements []int, low int, high int) { function main (line 37) | func main() { FILE: Algorithms/Sorting/Quick_Sort/quicksort.C function main (line 4) | void main() function partition (line 13) | int partition(int a[], int beg, int end) function quickSort (line 49) | void quickSort(int a[], int beg, int end) FILE: Algorithms/Sorting/Quick_Sort/quicksort.c function main (line 4) | void main() function partition (line 13) | int partition(int a[], int beg, int end) function quickSort (line 49) | void quickSort(int a[], int beg, int end) FILE: Algorithms/Sorting/Radix_Sort/Radix Sort With C (Mayukh Mitra)/Radix_sort.c function max (line 4) | int max(int arr[], int n) function counting_sort (line 14) | void counting_sort(int arr[], int n, int j) function radix_sort (line 35) | void radix_sort(int arr[], int n) function main (line 45) | int main() FILE: Algorithms/Sorting/Radix_Sort/RadixSort.java class Radix_Sort (line 1) | public class Radix_Sort { method main (line 2) | public static void main(String[] args) { method largest (line 12) | static int largest(inta[]) method radix_sort (line 22) | static void radix_sort(inta[]) FILE: Algorithms/Sorting/Radix_Sort/RadixSort.py function countingSort (line 5) | def countingSort(arr, exp1): function radixSort (line 40) | def radixSort(arr): FILE: Algorithms/Sorting/Radix_Sort/Radix_Sort.js function radixSort (line 13) | function radixSort(list) { FILE: Algorithms/Sorting/Radix_Sort/Radix_Sort.rb function counting_sort (line 1) | def counting_sort(input_arr, exp) function radix_sort (line 27) | def radix_sort(arr) FILE: Algorithms/Sorting/Radix_Sort/Radix_sort.cs class Program (line 4) | class Program method Sort (line 6) | static void Sort(int[] arr) method Main (line 24) | static void Main(string[] args) FILE: Algorithms/Sorting/Radix_Sort/radixSort.php function countSort (line 9) | function countSort(&$arr, $size, $exp) function radixsort (line 41) | function radixsort(&$arr, $size) function printArray (line 57) | function printArray(&$arr,$size) FILE: Algorithms/Sorting/Radix_Sort/radixsort.cpp function max (line 4) | int max(int arr[], int n) function counting_sort (line 14) | void counting_sort(int arr[], int n, int j) function radix_sort (line 35) | void radix_sort(int arr[], int n) function main (line 43) | int main() FILE: Algorithms/Sorting/Selection_Algorithms.cpp function swapping (line 3) | void swapping(int &a, int &b) { //swap the content of a and b function display (line 9) | void display(int *array, int size) { function selectionSort (line 14) | void selectionSort(int *array, int size) { function main (line 25) | int main() { FILE: Algorithms/Sorting/Selection_Sort/SelectionSort.java class SelectionSort (line 3) | class SelectionSort method sort (line 5) | void sort(int arr[]) method printArray (line 26) | void printArray(int arr[]) method main (line 35) | public static void main(String args[]) FILE: Algorithms/Sorting/Selection_Sort/SelectionSort.py function selection_sort (line 1) | def selection_sort(lst): FILE: Algorithms/Sorting/Selection_Sort/Selection_Sort.cpp function selection_sort (line 4) | void selection_sort(int a[],int n){ function main (line 15) | int main(){ FILE: Algorithms/Sorting/Selection_Sort/Selection_Sort.go function selectionSort (line 8) | func selectionSort(arr [100]int, n int) { function printArray (line 25) | func printArray(arrs [100]int, n int) { function main (line 32) | func main() { FILE: Algorithms/Sorting/Selection_Sort/selection sort.cs class GFG (line 5) | class GFG method sort (line 7) | static void sort(int []arr) method printArray (line 29) | static void printArray(int []arr) method Main (line 38) | public static void Main() FILE: Algorithms/Sorting/Selection_Sort/selection_sort.c function main (line 2) | int main(){ FILE: Algorithms/Sorting/Shell_Sort/Shell_Sort.c function main (line 4) | int main() FILE: Algorithms/Sorting/Shell_Sort/Shell_Sort.cpp function ShellSort (line 7) | void ShellSort(int sortArray[], int size) { function main (line 24) | int main() { FILE: Algorithms/Sorting/Shell_Sort/Shell_Sort.cs class ShellSort (line 1) | class ShellSort method printArray (line 3) | static void printArray(int []arr) method sort (line 11) | int sort(int []arr) method Main (line 32) | public static void Main() FILE: Algorithms/Sorting/Shell_Sort/Shell_Sort.java class ShellSort (line 5) | public class ShellSort { method shellSort (line 7) | private static void shellSort(Comparable[] arr) method lessThan (line 24) | private static boolean lessThan(Comparable first, Comparable second) method swap (line 29) | private static void swap(Comparable[] arr, int first, int second) method printSortedArray (line 36) | private static void printSortedArray(Comparable[] arr) method main (line 43) | public static void main(String[] args) throws IOException FILE: Algorithms/Sorting/Shell_Sort/shell_sort.py function shell (line 1) | def shell(a): FILE: Algorithms/Sorting/Stooge_Sort/Stooge_Sort.cs class Program (line 12) | class Program method Main (line 17) | public static void Main() method StoogeSort (line 37) | public static void StoogeSort(ref int[] arr) method StoogeSort (line 47) | public static void StoogeSort(ref int[] arr, int lowIndex, int highInd... FILE: Algorithms/Sorting/Stooge_Sort/Stooge_Sort.go function main (line 7) | func main() { function stoogesort (line 13) | func stoogesort(arr []int) { FILE: Algorithms/Sorting/Stooge_Sort/Stooge_Sort.py function stooge (line 14) | def stooge(number_list: List[int], last: int, first: int = 0): FILE: Algorithms/Sorting/Strand_Sort/Strand_Sort.cpp function strandSort (line 42) | void strandSort(list &ip, list &op) function main (line 61) | int main(void) FILE: Algorithms/Sorting/Strand_Sort/Strand_sort.java class Strand_sort (line 2) | public class Strand_sort { method main (line 3) | public static void main(String args[]) FILE: Algorithms/Sorting/Strand_Sort/strand_sort.c type node_t (line 3) | typedef struct node_t *node, node_t; type node_t (line 4) | struct node_t { int v; node next; } type slist (line 5) | typedef struct { node head, tail; } slist; function push (line 7) | void push(slist *l, node e) { function node (line 13) | node removehead(slist *l) { function join (line 22) | void join(slist *a, slist *b) { function merge (line 27) | void merge(slist *a, slist *b) { function sort (line 37) | void sort(int *ar, int len) function show (line 60) | void show(const char *title, int *x, int len) function main (line 68) | int main(void) FILE: Algorithms/Sorting/Strand_Sort/strand_sort.ts function strandSort (line 1) | function strandSort(arrin: number[]): number[] { FILE: Algorithms/Sorting/Tim_Sort/Tim_Sort.c function min (line 6) | int min (int a, int b) function insertionSort (line 14) | void insertionSort (int a[], int low, int high) function merge (line 27) | void merge (int a[], int left, int mid, int right) function timSort (line 56) | void timSort (int a[], int n) function main (line 72) | void main () FILE: Algorithms/Sorting/Tim_Sort/Tim_Sort.java class Timsort (line 1) | class Timsort{ method insertionSort (line 5) | public static void insertionSort(int[] arr, int left, int right) method merge (line 20) | public static void merge(int[] arr, int l,int m, int r) method timSort (line 68) | public static void timSort(int[] arr, int n) method printArray (line 86) | public static void printArray(int[] arr, int n) method main (line 95) | public static void main(String[] args) FILE: Algorithms/Sorting/Tim_Sort/Tim_Sort.py function InsSort (line 3) | def InsSort(arr,start,end): function merge (line 13) | def merge(arr,start,mid,end): function TimSort (line 46) | def TimSort(arr): FILE: Algorithms/Sorting/Topological_Sort/Topological_Sort.cpp class Graph (line 9) | class Graph { function main (line 90) | int main() FILE: Algorithms/Sorting/Topological_Sort/Topological_sort.cs class Graph (line 7) | class Graph { method Graph (line 16) | Graph(int v) method AddEdge (line 25) | public void AddEdge(int v, int w) { adj[v].Add(w); } method TopologicalSortUtil (line 28) | void TopologicalSortUtil(int v, bool[] visited, method TopologicalSort (line 45) | void TopologicalSort() method Main (line 64) | public static void Main(string[] args) FILE: Algorithms/Sorting/Topological_Sort/Topological_sort.py class Graph (line 4) | class Graph: method __init__ (line 5) | def __init__(self,vertices): method addEdge (line 10) | def addEdge(self,u,v): method topologicalSortUtil (line 14) | def topologicalSortUtil(self,v,visited,stack): method topologicalSort (line 29) | def topologicalSort(self): FILE: Algorithms/Sorting/Tree_Sort/Tree_Sort.c type Node (line 6) | struct Node type Node (line 13) | struct Node type Node (line 15) | struct Node function storeSorted (line 23) | void storeSorted(Node *root, int arr[], int &i) function Node (line 35) | Node* insert(Node* node, int key) function treeSort (line 51) | void treeSort(int arr[], int n) function main (line 67) | int main() FILE: Algorithms/Sorting/Tree_Sort/tree sort.cpp type tree (line 3) | struct tree{ class TreeSort (line 8) | class TreeSort{ function tree (line 32) | tree* TreeSort::insert2(tree *temp,tree *newnode){ function main (line 67) | int main(){ FILE: Algorithms/Sorting/Tree_Sort/treesort.java class Node (line 1) | class Node{ method Node (line 5) | Node(int value){ class BST (line 12) | class BST{ method BST (line 14) | BST(int value){ method insert (line 17) | public Node insert(Node node, int value){ method inOrder (line 33) | public void inOrder(Node node){ class TreeSort (line 44) | public class TreeSort { method main (line 45) | public static void main(String[] args) { FILE: Algorithms/Sorting/Wave_Sort/Wave_Sort.py function sortInWave (line 1) | def sortInWave(arr_demo, n): FILE: Algorithms/Sorting/Wave_Sort/wave_sort.c function swap (line 6) | void swap(int *x, int *y) function sortInWave (line 14) | void sortInWave(int arr[], int n) function main (line 29) | int main() FILE: Algorithms/Sorting/Wave_Sort/wave_sort.cpp function printArray (line 6) | void printArray(int arr[], int size) function swap (line 20) | void swap(int *x, int *y) function waveSort (line 30) | void waveSort(int arr[], int size) function main (line 56) | int main() FILE: Algorithms/Stack-Algorithm/Next_Greater_Element.cpp function ll (line 18) | inline ll mul(ll a, ll b){ return (a * 1ll * b) % mod; } function ll (line 19) | inline ll sub(ll a, ll b){ ll c = a - b; if(c < 0) c += mod; return c; } function ll (line 20) | inline ll add(ll a, ll b){ ll c = a + b; if(c >= mod) c -= mod; return c; } function next_greater (line 30) | void next_greater(vector &A) function main (line 52) | int main() FILE: Algorithms/Stack-Algorithm/RemoveKDigitsToGetSmallestPossibleInteger.java class RemoveKDigitsToGetSmallestPossibleInteger (line 3) | public class RemoveKDigitsToGetSmallestPossibleInteger{ method main (line 4) | public static void main(String[]args){ method removeKdigits (line 19) | public static String removeKdigits(String num, int k) { FILE: Algorithms/Stack-Algorithm/Simplify-Path/Simplify_Path.cpp function string (line 5) | string simplifyPath(string path) function main (line 28) | int main() FILE: Algorithms/Stack-Algorithm/balanced_brackets_stack.cpp function isBalanced (line 4) | bool isBalanced(string str) function main (line 24) | int main() FILE: Algorithms/Stack-Algorithm/immediate_smaller_element.cpp function main (line 25) | int main(){ FILE: Algorithms/Stack-Algorithm/longest_valid_substring.cpp function main (line 26) | int main(){ FILE: Algorithms/String/Anagram/AnagramChecker.c function main (line 2) | int main() function check_anagram (line 19) | int check_anagram(char a[] , char b[]) FILE: Algorithms/String/Anagram/anagram c#.cs class Anagrams (line 3) | class Anagrams { method isAnagram (line 5) | static bool isAnagram(string a, string b){ method Main (line 28) | static void Main() FILE: Algorithms/String/Anagram/anagram.c function main (line 5) | int main() function check_anagram (line 27) | int check_anagram(char a[], char b[]) FILE: Algorithms/String/Anagram/anagram.java class AnagramProgram (line 3) | public class AnagramProgram { method isAnagram (line 4) | static void isAnagram(String s1, String s2) { method main (line 36) | public static void main(String[] args) { FILE: Algorithms/String/Anagram/anagram.py function check (line 2) | def check(s1, s2): FILE: Algorithms/String/Isomorphic/Isomorphic-String.java class Main (line 3) | class Main method isIsomorphic (line 6) | public static boolean isIsomorphic(String X, String Y) method main (line 54) | public static void main(String[] args) FILE: Algorithms/String/Isomorphic/isomorphic.cpp function isIsomorphic (line 8) | bool isIsomorphic(string X, string Y) function main (line 51) | int main() FILE: Algorithms/String/KMP/KMP_Algorithm.php function KMPSearch (line 3) | function KMPSearch($pat, $txt) function computeLPSArray (line 34) | function computeLPSArray($pat, $M, &$lps) FILE: Algorithms/String/KMP/kmp.cpp function KMPSearch (line 8) | void KMPSearch(string pat, string txt) function computeLPSArray (line 46) | void computeLPSArray(string pat, int M, string lps) function main (line 82) | int main() FILE: Algorithms/String/KMP/kmp.js function buildLPSArray (line 6) | function buildLPSArray(pattern, M) { function KMPSearch (line 28) | function KMPSearch(text, pattern) { function test (line 57) | function test() { FILE: Algorithms/String/LCS/LCS.py function LCS (line 6) | def LCS(A,B,m,n): FILE: Algorithms/String/LCS/lcs.cpp function lcs (line 6) | void lcs( char *X, char *Y, int m, int n ) function main (line 47) | int main() FILE: Algorithms/String/LPS/longest_palindromic_substring.c function print (line 3) | void print(char* str, int low, int high) function longestSubstr (line 10) | void longestSubstr(char* str) function main (line 45) | int main() FILE: Algorithms/String/LPS/longest_palindromic_substring.cpp function string (line 5) | string expandAroundCenter(string s, int c1, int c2) { function string (line 15) | string LPS(string A) { function main (line 33) | int main() { FILE: Algorithms/String/LPS/longest_palindromic_substring.java class Solution (line 3) | class Solution { method longestPalindrome (line 4) | public static String longestPalindrome(String s) { method main (line 50) | public static void main(String[] args) FILE: Algorithms/String/LPS/longest_palindromic_substring.js function longestPalSubstr (line 23) | function longestPalSubstr(str) { FILE: Algorithms/String/LPS/longest_palindromic_substring.py function longestPalSubstr (line 1) | def longestPalSubstr(string): FILE: Algorithms/String/Palindrome/Palindrome.c function main (line 13) | int main(int argc, char const *argv[]){ function is_palindrome (line 36) | int is_palindrome(char *word){ FILE: Algorithms/String/Palindrome/Palindrome.cs class Test (line 5) | public class Test method Main (line 7) | public static void Main() FILE: Algorithms/String/Palindrome/Palindrome.java class palindrome (line 1) | public class palindrome { method isPalindrome (line 2) | static boolean isPalindrome(String word) { method main (line 16) | public static void main(String[] args) { FILE: Algorithms/String/Palindrome/isPalindrome.cpp function main (line 8) | int main() { FILE: Algorithms/String/Palindrome/palindrome.go function reverse (line 10) | func reverse(s string) string { function main (line 18) | func main() { FILE: Algorithms/String/Palindrome/palindrome.java class palindrome (line 1) | public class palindrome { method isPalindrome (line 2) | static boolean isPalindrome(String word) { method main (line 16) | public static void main(String[] args) { FILE: Algorithms/String/Palindrome/palindrome.js function palindromeCheck (line 20) | function palindromeCheck(word) { FILE: Algorithms/String/Palindrome/palindrome.php function isPalindrome (line 3) | function isPalindrome($str) { FILE: Algorithms/String/Palindrome/palindrome.py function palindrome (line 4) | def palindrome(rawString): FILE: Algorithms/String/Palindrome/palindrome.ts function palindromeCheck (line 8) | function palindromeCheck(str: string): boolean { FILE: Algorithms/String/Palindrome/palindromecheck.go function Reverse (line 8) | func Reverse(s string) (result string) { function isPalindrome (line 15) | func isPalindrome(str string) interface{} { function main (line 22) | func main() { FILE: Algorithms/String/Rabin-Karp/RabinKarpAlgo.java class RabinKarb (line 1) | public class RabinKarb { method search (line 6) | static void search(String pat, String txt, int primeNum) { method main (line 49) | public static void main(String[] args) { FILE: Algorithms/String/Rabin-Karp/Rabin_Karp.cpp function search (line 13) | void search(char pat[], char txt[], int q) function main (line 70) | int main() FILE: Algorithms/String/Rabin-Karp/Rabin_Karp.ts function strStr (line 1) | function strStr(text: string, pattern: string): number { FILE: Algorithms/String/Rabin-Karp/Rabin_karp.c function main (line 6) | int main(){ FILE: Algorithms/String/Rabin-Karp/rabin_karp.py function search (line 2) | def search(pat, txt, q): FILE: Algorithms/String/SCS/SCS.cpp function LCS (line 13) | int LCS(string X,string Y,int n,int m) function SCS (line 31) | int SCS(string X,string Y,int n,int m) function main (line 35) | int main() FILE: Algorithms/String/ScrambleString.java class Sample (line 6) | public class Sample method isScramble (line 8) | static boolean isScramble(String S1, String S2) method main (line 55) | public static void main(String[] args) throws IOException FILE: Algorithms/String/suffix_array.cpp function count_sort (line 5) | void count_sort(vector&p,vector&c) function main (line 24) | int main() { FILE: Algorithms/Tree/Binary_Lifting/Binary Lifting.py function dfs (line 4) | def dfs(u, p, memo, lev, log, g): function lca (line 16) | def lca(u, v, log, lev, memo): FILE: Algorithms/Tree/Binary_Lifting/Binary-Lifting.cpp function dfs (line 22) | void dfs(int ver, int par) { function precompute (line 44) | void precompute(int root) { function is_Ancestor (line 53) | bool is_Ancestor(int v1, int v2) { function LCA (line 57) | int LCA(int v1, int v2) { function main (line 82) | int main() { FILE: Algorithms/Tree/GenericTreeImplementation/GenericTree.c type element (line 6) | typedef int element; type node (line 7) | struct node function GenericTree (line 14) | GenericTree create() function isEmpty (line 19) | int isEmpty(GenericTree gt) function GenericTree (line 24) | GenericTree build(element e, GenericTree firstchild, GenericTree nextsib... function nodeCount (line 36) | int nodeCount(GenericTree tree) function nodeSum (line 44) | int nodeSum(GenericTree tree) function nbS (line 51) | int nbS(GenericTree tree) function nbC (line 62) | int nbC(GenericTree tree) function main (line 75) | int main() FILE: Algorithms/Tree/GenericTreeImplementation/GenericTree.cpp class treenode (line 6) | class treenode{ method treenode (line 11) | treenode(int data){ function treenode (line 22) | treenode* takeinput(){ method treenode (line 11) | treenode(int data){ function printtree (line 52) | void printtree(treenode* root){ function main (line 71) | int main(){ FILE: Algorithms/Tree/GenericTreeImplementation/GenericTree.java class Main (line 3) | public class Main { method main (line 4) | public static void main(String[] args) { class GenericTreeImplementation (line 8) | class GenericTreeImplementation { class Node (line 9) | class Node { method Node (line 13) | Node(int d) { method GenericTreeImplementation (line 21) | GenericTreeImplementation() { method good (line 26) | private Node good(Scanner s, Node parent, int i) { FILE: Algorithms/Tree/LCA/LCA.cpp class Solution (line 15) | class Solution method TreeNode (line 18) | TreeNode *lowestCommonAncestor(TreeNode *root, TreeNode *p, TreeNode *q) FILE: Algorithms/Tree/LCA/LCA.cs class Node (line 4) | public class Node method Node (line 9) | public Node(int item) class BinaryTree (line 16) | public class BinaryTree method lca (line 22) | public virtual Node lca(Node node, int n1, int n2) method Main (line 45) | public static void Main(string[] args) FILE: Algorithms/Tree/LCA/LCA.py class Solution (line 11) | class Solution: method lowestCommonAncestor (line 12) | def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'Tr... FILE: Algorithms/Tree/Max_Heap_Construction/minmaxheap.cpp function min_heapify (line 5) | void min_heapify(int *heap,int i,int n) function build_minheap (line 25) | void build_minheap(int *heap, int n) function max_heapify (line 33) | void max_heapify(int *heap, int i, int n) function build_maxheap (line 53) | void build_maxheap(int *heap,int n) function main (line 62) | int main() FILE: Algorithms/Tree/Max_Path_Sum_BST/Max_Path_Sum_BST.cpp class Solution (line 13) | class Solution { method maxPathSum_ (line 16) | int maxPathSum_(TreeNode* root) method maxPathSum (line 28) | int maxPathSum(TreeNode* root) { FILE: Algorithms/Tree/Max_Path_Sum_BST/Max_Path_Sum_BST.py class TestProgram (line 19) | class TestProgram(unittest.TestCase): method test_case_1 (line 20) | def test_case_1(self): class BinaryTree (line 25) | class BinaryTree: method __init__ (line 26) | def __init__(self, value): method insert (line 31) | def insert(self, values, i=0): function maxPathSum (line 52) | def maxPathSum(tree): function findMaxSum (line 57) | def findMaxSum(tree): FILE: Algorithms/Tree/Min_Heap_Construction/min-heap-construc.cpp function public (line 3) | public FILE: Algorithms/Tree/Min_Heap_Construction/min-heap-construc.py class MinHeap (line 1) | class MinHeap: method __init__ (line 2) | def __init__(self, array): method buildHeap (line 6) | def buildHeap(self, array): method siftDown (line 13) | def siftDown(self, currIdx, endIdx, heap): method siftUp (line 29) | def siftUp(self, currIdx, heap): method peek (line 37) | def peek(self): method remove (line 42) | def remove(self): method insert (line 49) | def insert(self, value): method swap (line 53) | def swap(self,i,j,heap): FILE: Algorithms/Tree/Sorted-Array-To-BST/Sorted-Array-To-BST.cpp class TNode (line 5) | class TNode function TNode (line 17) | TNode* sortArrayToBST(int arr[], int start, int end) function TNode (line 41) | TNode* newNode(int data) function preOrder (line 53) | void preOrder(TNode* node) function main (line 63) | int main() FILE: Algorithms/Tree/Sorted_Array_To_BST/SortedArrayToBST.java class Node (line 1) | class Node { method Node (line 6) | Node(int d) { class BinaryTree (line 12) | class BinaryTree { method sortedArrayToBST (line 14) | Node sortedArrayToBST(int arr[], int start, int end) { method preOrder (line 36) | void preOrder(Node node) { class SortedArrayToBST (line 46) | public class SortedArrayToBST { method main (line 48) | public static void main(String[] args) { FILE: Algorithms/Tree/Validate_BST/Validate_BST.cpp type node (line 8) | struct node { type node (line 9) | struct node type node (line 10) | struct node method node (line 15) | node(int k): val(k), left(NULL), right(NULL), maxTillNow(MIN), minTill... function max (line 18) | int max(int a, int b){ function min (line 21) | int min(int a, int b){ function setMaxMinTillNode (line 33) | void setMaxMinTillNode( node * root){ function isBST (line 67) | bool isBST(node * root){ function main (line 106) | int main() { FILE: Algorithms/Tree/Validate_BST/Validate_BST.cs class Node (line 3) | internal class Node method Node (line 8) | public Node(int item) class Validate_BST (line 15) | public class Validate_BST method IsBST (line 17) | static bool IsBST( method Main (line 36) | public static void Main(string[] args) FILE: Algorithms/Tree/Validate_BST/Validate_BST.java class Node (line 3) | class Node { method Node (line 8) | Node(int value) { class Solution (line 14) | class Solution { method isValidBST (line 16) | public boolean isValidBST(Node root) { method helper (line 19) | public boolean helper(Node root, Integer small, Integer large) class Validate_BST (line 31) | public class Validate_BST method main (line 34) | public static void main(String[] args){ FILE: Algorithms/Tree/level_traversing/level_traversing.php class TreeNode (line 3) | class TreeNode {//Definition for binary tree node. method __construct (line 7) | function __construct($val = 0, $left = null, $right = null) { class Solution (line 14) | class Solution {//Recursive solution for level order traversal method levelOrder (line 20) | function levelOrder($root) { method helper (line 27) | function helper($node, &$mainList, $level) { FILE: Algorithms/Tree/level_traversing/level_traversing.py class TreeNode (line 12) | class TreeNode: method __init__ (line 13) | def __init__(self, val=0, left=None, right=None): function levelOrder (line 19) | def levelOrder(root: TreeNode) -> List[List[int]]: function recurse_input (line 49) | def recurse_input(i, node_lst): function run (line 59) | def run(): FILE: Collection/ArrayDeque/ArrayDeque.java class ArrayDequeDemo (line 11) | public class ArrayDequeDemo method main (line 13) | public static void main(String[] args) FILE: Collection/ArrayList/ArrayList .java class Arraylist (line 5) | public class Arraylist { method main (line 7) | public static void main(String[] args) { FILE: Collection/HashMap/HashMap.java class HashMapDemo (line 4) | class HashMapDemo { method main (line 17) | public static void main(String[] args) { FILE: Collection/HashSet/HashSet.java class HashSetDemo (line 5) | class HashSetDemo { method main (line 22) | public static void main(String[] args) { FILE: Collection/LinkedList/LinkedList.java class LinkedListDemo (line 8) | class LinkedListDemo{ method main (line 9) | public static void main(String args[]){ FILE: Collection/Queue/Deque/Deque.java class DequeDemo (line 3) | class DequeDemo{ method main (line 18) | public static void main(String[] args) { FILE: Collection/Queue/PriorityQueue/PriorityQueue.java class PriorityQueueDemo (line 4) | class PriorityQueueDemo{ method main (line 15) | public static void main(String[] args) { FILE: Collection/Queue/Queue.java class Main (line 5) | public class Main { method main (line 6) | public static void main(String[] args) { FILE: Collection/Stack/StackCollection.java class StackCollection (line 4) | public class StackCollection{ method main (line 5) | public static void main(String[] args) { FILE: Collection/Vector/Vector.java class Main (line 4) | class Main { method main (line 6) | public static void main(String[] args) FILE: Data-Structures/Array/Array.c function main (line 4) | int main() FILE: Data-Structures/Array/Array.cpp function main (line 4) | int main() FILE: Data-Structures/Array/Array.go function main (line 5) | func main() { FILE: Data-Structures/Array/Array.java class Array (line 5) | public class Array { method main (line 7) | public static void main(String[] args) { FILE: Data-Structures/Array/Array.ts function readInput (line 9) | function readInput(prompt: string): Promise { function main (line 28) | async function main() { FILE: Data-Structures/Array/array_menudriven.cpp class Array (line 4) | class Array method Array (line 13) | Array() method Array (line 19) | Array(int sz) function Array (line 301) | Array* Array::Merge(Array arr2) method Array (line 13) | Array() method Array (line 19) | Array(int sz) function Array (line 330) | Array* Array::Union(Array arr2) method Array (line 13) | Array() method Array (line 19) | Array(int sz) function Array (line 366) | Array* Array::Inter(Array arr2) method Array (line 13) | Array() method Array (line 19) | Array(int sz) function Array (line 395) | Array* Array::Diff(Array arr2) method Array (line 13) | Array() method Array (line 19) | Array(int sz) function main (line 427) | int main() FILE: Data-Structures/Graph/UsingList.cpp function displayAdjList (line 5) | void displayAdjList(list adj_list[], int v) { function add_edge (line 15) | void add_edge(list adj_list[], int u, int v) { //add v into the ... function main (line 19) | main(int argc, char* argv[]) { FILE: Data-Structures/Graph/UsingList.py class node (line 6) | class node(): method __init__ (line 8) | def __init__(self, node_name): method add_neigbor (line 12) | def add_neigbor(self, neighbor): # neighbor is node name. not node obj... method list_edges_of (line 15) | def list_edges_of(self): method get_node_name (line 18) | def get_node_name(self): method __str__ (line 21) | def __str__(self): class graph (line 25) | class graph(): method __init__ (line 27) | def __init__(self): method add_node (line 33) | def add_node(self, node_name): method get_node (line 41) | def get_node(self, node_name_to_search): # return node which its name ... method get_edges_of_node (line 48) | def get_edges_of_node(self, node_name_to_search): method update_adj_list (line 52) | def update_adj_list(self): method add_edge (line 62) | def add_edge(self, from_node, to_node): # in fact from and to notation... method get_all_node_objects_in_graph (line 91) | def get_all_node_objects_in_graph(self): method __iter__ (line 94) | def __iter__(self): method __contains__ (line 97) | def __contains__(self, node_name_to_search): function bfs (line 113) | def bfs(graph, entry_node): function dfs (line 136) | def dfs(graph, start): FILE: Data-Structures/Graph/UsingMatrix.cpp function DFS (line 7) | void DFS(int matrix[5][5], int visit[],int visitTo=0){ function BFS (line 15) | void BFS(int matrix[5][5], int visit[], int row=0){ function main (line 32) | int main() FILE: Data-Structures/Graph/graph_implementation_in_C_bfs_dfs.c type node (line 11) | struct node{ type node (line 17) | struct node type node (line 18) | struct node type node (line 18) | struct node type Graph (line 24) | struct Graph{ type Graph (line 31) | struct Graph type Graph (line 32) | struct Graph type Graph (line 32) | struct Graph type node (line 35) | struct node function addEdge (line 46) | void addEdge(struct Graph* graph, int src, int dest){ type queue (line 58) | struct queue{ type queue (line 65) | struct queue type queue (line 66) | struct queue type queue (line 66) | struct queue function enqueue (line 73) | void enqueue( struct queue* q, int value ){ function isEmpty (line 85) | int isEmpty( struct queue* q ){ function dequeue (line 93) | int dequeue( struct queue* q ){ function printQueue (line 110) | void printQueue( struct queue* q ){ function bfs (line 123) | void bfs( struct Graph* graph, int startVertex ){ function DFS (line 149) | void DFS(struct Graph* graph, int vertex){ function main (line 167) | int main(){ FILE: Data-Structures/HashSet/Hash-Set.c type hashpair (line 9) | typedef struct { type Hashset (line 21) | typedef struct { function Hashset (line 43) | Hashset make_hashset(int size, long (*hashfn)(void *)) { function rehash (line 64) | static void rehash(Hashset *hs) { function hs_add (line 104) | int hs_add(Hashset *hs, void *value) { function hs_contains (line 139) | int hs_contains(Hashset *hs, void *value) { function hs_delete (line 211) | void hs_delete(Hashset *hs, void (*delfn)(void *)) { function __hash__ (line 232) | static inline long __hash__(void *val) { return (long)val; } function __del__ (line 234) | static inline void __del__( function main (line 238) | void main() { FILE: Data-Structures/LinkedList/Circular_Linked_List/CircularLinkedList.c type node (line 6) | struct node { type node (line 13) | struct node type node (line 14) | struct node function isEmpty (line 16) | bool isEmpty() { function length (line 20) | int length() { function insertFirst (line 39) | void insertFirst(int key, int data) { type node (line 59) | struct node type node (line 62) | struct node function printList (line 77) | void printList() { function main (line 94) | void main() { FILE: Data-Structures/LinkedList/Circular_Linked_List/CircularLinkedList.java class CircularLinkedList (line 1) | public class CircularLinkedList { method CircularLinkedList (line 5) | public CircularLinkedList() { method isEmpty (line 9) | public boolean isEmpty() { method addToTail (line 13) | public void addToTail(int el) { method printAll (line 27) | public void printAll() { class Node (line 38) | class Node { method Node (line 43) | public Node(int el) { method Node (line 49) | public Node(int el, Node next, Node prev) { FILE: Data-Structures/LinkedList/Circular_Linked_List/Circular_Link_List.cpp class Node (line 4) | class Node{ function createNode (line 10) | void createNode(){ function print (line 31) | void print(){ function main (line 48) | int main(){ FILE: Data-Structures/LinkedList/Circular_Linked_List/circularLinkedList.js function circularLinkedList (line 1) | function circularLinkedList() { FILE: Data-Structures/LinkedList/Circular_Linked_List/circularLinkedList.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, data): class CircularLinkedList (line 6) | class CircularLinkedList: method __init__ (line 7) | def __init__(self, key): function insert_after (line 12) | def insert_after(n, a): function insert_at_last (line 16) | def insert_at_last(l, n): function delete (line 21) | def delete(l, n): function traversal (line 36) | def traversal(l): FILE: Data-Structures/LinkedList/Circular_Linked_List/csharp/CircularLinkedList.cs class Circularlist (line 9) | class Circularlist method Circularlist (line 13) | public Circularlist() method Circularlist (line 18) | public Circularlist(int value) method Insdata (line 23) | public Circularlist Insdata(int value) method Deldata (line 39) | public int Deldata() method Traverse (line 51) | public void Traverse() method Traverse (line 55) | public void Traverse(Circularlist node) method Gnodes (line 68) | public int Gnodes() method Gnodes (line 72) | public int Gnodes(Circularlist node) method Main (line 88) | static void Main(string[] args) FILE: Data-Structures/LinkedList/Doubly_Linked_List/Double linked List circular with double headers C++/dllist.cpp function DLNode (line 30) | DLNode* DLList::insertData(DLNode *p, Agent&e) { function DLNode (line 91) | DLNode *DLList::getPrevPos(DLNode*p) { function DLNode (line 99) | DLNode *DLList::getNextPos(DLNode* p) { function DLNode (line 106) | DLNode *DLList::findData(Agent& e) { function DLNode (line 152) | DLNode* DLList::getFirstPos() { function DLNode (line 158) | DLNode* DLList::getLastPos() { function Agent (line 165) | Agent& DLList::retrieve(DLNode* p) { FILE: Data-Structures/LinkedList/Doubly_Linked_List/Double linked List circular with double headers C++/dllist.h function class (line 8) | class DLList { FILE: Data-Structures/LinkedList/Doubly_Linked_List/Double linked List circular with double headers C++/dlnode.cpp function Agent (line 19) | Agent* DLNode::getDataPtr() { function Agent (line 23) | Agent& DLNode::getData() { function DLNode (line 31) | DLNode* DLNode::getPrev() { function DLNode (line 35) | DLNode* DLNode::getNext() { FILE: Data-Structures/LinkedList/Doubly_Linked_List/Double linked List circular with double headers C++/dlnode.h function class (line 5) | class DLNode { FILE: Data-Structures/LinkedList/Doubly_Linked_List/Double linked List circular with double headers C++/listexception.h function class (line 6) | class ListException : public std::exception { FILE: Data-Structures/LinkedList/Doubly_Linked_List/Double linked List circular with double headers C++/main.cpp function main (line 5) | int main() { FILE: Data-Structures/LinkedList/Doubly_Linked_List/Double linked List circular with double headers C++/nodeexception.h function class (line 5) | class NodeException : public std::exception { FILE: Data-Structures/LinkedList/Doubly_Linked_List/DoubleLinkedList.java class DoubleLinkedList (line 1) | class DoubleLinkedList method LinkedList (line 7) | public LinkedList(LinkedList prev, T value, LinkedList next) { method LinkedList (line 13) | public LinkedList(T value) { method GetPrev (line 17) | public LinkedList GetPrev() { method GetValue (line 21) | public T GetValue() { method GetNext (line 25) | public LinkedList GetNext() { method SetPrev (line 29) | public void SetPrev(LinkedList prev) { method SetValue (line 33) | public void SetValue(T value) { method SetNext (line 37) | public void SetNext(LinkedList next) { FILE: Data-Structures/LinkedList/Doubly_Linked_List/DoublyLinkedList.cs class DoublyLinkedListNode (line 9) | public class DoublyLinkedListNode method DoublyLinkedListNode (line 12) | public DoublyLinkedListNode(T value) class DoublyLinkedList (line 29) | public class DoublyLinkedList method Add (line 34) | public int Add(T item) method Insert (line 57) | public void Insert(int index, T item) method Remove (line 93) | public bool Remove(T item) method Check (line 150) | public bool Check(T item) method Search (line 169) | public T Search(T item) method isEmpty (line 193) | public bool isEmpty() method Size (line 202) | public int Size() method Index (line 212) | public int Index(T item) FILE: Data-Structures/LinkedList/Doubly_Linked_List/DoublyLinkedList_C++_Template/DLL.h type Node (line 14) | struct Node { type Node (line 141) | struct Node { FILE: Data-Structures/LinkedList/Doubly_Linked_List/DoublyLinkedList_C++_Template/DLLtest.cpp function main (line 6) | int main(void) { FILE: Data-Structures/LinkedList/Doubly_Linked_List/Doubly_Linked_List.py class Node (line 2) | class Node: method __init__ (line 3) | def __init__(self, value): class DoublyLinkedList (line 9) | class DoublyLinkedList: method __init__ (line 10) | def __init__(self): method setHead (line 14) | def setHead(self, node): method setTail (line 22) | def setTail(self, node): method insertBefore (line 28) | def insertBefore(self, node, nodeToInsert): method insertAfter (line 42) | def insertAfter(self, node, nodeToInsert): method insertAtPosition (line 55) | def insertAtPosition(self, position, nodeToInsert): method removeNodesWithValue (line 70) | def removeNodesWithValue(self, value): method remove (line 79) | def remove(self, node): method removeNodeBindings (line 87) | def removeNodeBindings(self,node): method containsNodeWithValue (line 96) | def containsNodeWithValue(self, value): FILE: Data-Structures/LinkedList/Doubly_Linked_List/double_linked_list.c type Node (line 3) | struct Node function create (line 9) | void create(int A[],int n) function Display (line 27) | void Display(struct Node *p) function Length (line 36) | int Length(struct Node *p) type Node (line 46) | struct Node type Node (line 48) | struct Node type Node (line 54) | struct Node type Node (line 54) | struct Node type Node (line 65) | struct Node type Node (line 65) | struct Node type Node (line 68) | struct Node function main (line 79) | int main() FILE: Data-Structures/LinkedList/Doubly_Linked_List/doubly.c type node (line 4) | struct node{ function insert (line 9) | void insert(struct node **LH,struct node **RH,int val){ function Display (line 73) | void Display(struct node **LH,struct node ** RH){ function delete_Link (line 83) | void delete_Link(struct node **LH,struct node **RH){ function main (line 145) | int main(){ FILE: Data-Structures/LinkedList/Doubly_Linked_List/doubly_ll.py class Node (line 4) | class Node(object): method __init__ (line 6) | def __init__(self, data=None, next=None, prev=None): class doubly_linked_list (line 12) | class doubly_linked_list(object): method __init__ (line 13) | def __init__(self): method append_item (line 18) | def append_item(self, data): method iter (line 30) | def iter(self): method print_foward (line 38) | def print_foward(self): method reverse (line 42) | def reverse(self): FILE: Data-Structures/LinkedList/Doubly_Linked_List/simple linked list circular without header/main.cpp function main (line 5) | int main() FILE: Data-Structures/LinkedList/Doubly_Linked_List/simple linked list circular without header/sllist.cpp function SLNode (line 17) | SLNode* SLList::getPrevPos( SLNode*& p) { function SLNode (line 54) | SLNode* SLList::findData( Client& e) { function SLNode (line 162) | SLNode* SLList::getFirsPos() { function SLNode (line 166) | SLNode* SLList::getLastPos() { function SLNode (line 178) | SLNode* SLList::getNextPos( SLNode*& p) { //pendiente function Client (line 186) | Client& SLList::retrieve( SLNode* p) { FILE: Data-Structures/LinkedList/Doubly_Linked_List/simple linked list circular without header/sllist.h function class (line 8) | class SLList { FILE: Data-Structures/LinkedList/Doubly_Linked_List/simple linked list circular without header/slnode.cpp function Client (line 8) | Client& SLNode::getData() { function SLNode (line 11) | SLNode* SLNode::getNext() { FILE: Data-Structures/LinkedList/Doubly_Linked_List/simple linked list circular without header/slnode.h function class (line 6) | class SLNode { FILE: Data-Structures/LinkedList/Singly_Linked_List/Delete_Kth_Node_From_End/Delete_Kth_Node_From_End.cpp type node (line 3) | struct node type node (line 6) | struct node type node (line 8) | struct node type node (line 6) | struct node function nodeptr (line 9) | nodeptr getNode(long long int item) function nodeptr (line 16) | nodeptr insertAtTheBeginning(long long int item, nodeptr start) function nodeptr (line 28) | nodeptr insertAtTheEnd(long long int item, nodeptr start) function nodeptr (line 39) | nodeptr insertAtLocation(long long int item, nodeptr start, long long in... function nodeptr (line 55) | nodeptr deleteFirst(nodeptr start) function nodeptr (line 62) | nodeptr deleteGivenNode(long long int item, nodeptr start) function display (line 77) | void display(nodeptr start) function countNodes (line 87) | long long int countNodes(nodeptr start) function nodeptr (line 101) | nodeptr deleteNode(nodeptr start, long long int counter, long long int k) function main (line 119) | int main() FILE: Data-Structures/LinkedList/Singly_Linked_List/Delete_Kth_Node_From_End/Delete_Kth_Node_From_End.java class Delete_Kth_Node_From_End (line 3) | class Delete_Kth_Node_From_End class Node (line 6) | static class Node method create (line 12) | static Node create(Node head, int x) method removeNthFromEnd (line 31) | static Node removeNthFromEnd(Node head, int B) method display (line 70) | static void display(Node head) method main (line 81) | public static void main(String[] args) FILE: Data-Structures/LinkedList/Singly_Linked_List/Delete_Kth_Node_From_End/Delete_Kth_Node_From_End.py function fibMonaccianSearch (line 7) | def fibMonaccianSearch(arr, x, n): FILE: Data-Structures/LinkedList/Singly_Linked_List/Delete_Kth_Node_From_End/Delete_Kth_Node_From_End.rb class Node (line 1) | class Node method initialize (line 4) | def initialize(value) class SinglyLinkedList (line 10) | class SinglyLinkedList method initialize (line 11) | def initialize method insert (line 16) | def insert(value) method delete_kth_from_end (line 30) | def delete_kth_from_end(k) method print_list (line 45) | def print_list FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/CycleDetection.c type LinkedListNode (line 8) | typedef struct LinkedListNode LinkedListNode; type LinkedListNode (line 11) | struct LinkedListNode { function LinkedListNode (line 16) | LinkedListNode* _insert_node_into_singlylinkedlist(LinkedListNode *head,... function hasCycle (line 34) | bool hasCycle(LinkedListNode* head) { function main (line 49) | int main() FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/CycleDetection.java class Node (line 4) | class Node { method Node (line 8) | Node(int value) { class Solution (line 14) | class Solution{ method create_list (line 17) | public void create_list(Node head,int node_value){ method hasCycle (line 31) | public boolean hasCycle(Node head) { class CycleDetection (line 47) | public class CycleDetection{ method main (line 48) | public static void main(String[] args){ FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/DetectCycle.cpp class Node (line 6) | class Node { function push (line 12) | void push(Node** head_ref, int new_data) function detectLoop (line 26) | int detectLoop(Node* list) function main (line 40) | int main() FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/DetectCycle.py class Node (line 2) | class Node: method __init__ (line 6) | def __init__(self, data): class LinkedList (line 10) | class LinkedList: method __init__ (line 13) | def __init__(self): method push (line 18) | def push(self, new_data): method printList (line 25) | def printList(self): method detectCycle (line 32) | def detectCycle(self): FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/DetectCycle.ts class ListNode (line 2) | class ListNode { method constructor (line 8) | constructor(data: any) { class LinkedList (line 14) | class LinkedList { method constructor (line 18) | constructor() { method append (line 24) | append(data: any) { method hasCycle (line 39) | hasCycle() { FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/Detect_Cycle.js class ListNode (line 1) | class ListNode { method constructor (line 2) | constructor(data) { class LinkedList (line 8) | class LinkedList { method constructor (line 9) | constructor(head = null) { method add (line 14) | add(element) method hasCycle (line 41) | hasCycle (head) { FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/detect_cycle.cs class Node (line 4) | public class Node method Node (line 8) | public Node(int val) class ClosedLoop (line 14) | class ClosedLoop method DetectLoop (line 16) | public static bool DetectLoop(Node _head) method Main (line 32) | static void Main(string[] args) FILE: Data-Structures/LinkedList/Singly_Linked_List/Detect_Cycle/detect_cycle.go type Node (line 5) | type Node struct function NewNode (line 10) | func NewNode(value int) *Node { function DetectLoop (line 17) | func DetectLoop(head *Node) bool { function main (line 31) | func main() { FILE: Data-Structures/LinkedList/Singly_Linked_List/Java/PalindromeLinkedList.java class ListNode (line 3) | class ListNode { method ListNode (line 6) | ListNode() {} method ListNode (line 7) | ListNode(int val) { this.val = val; } method ListNode (line 8) | ListNode(int val, ListNode next) { this.val = val; this.next = next; } class LinkedList (line 11) | class LinkedList { method addToTheLast (line 13) | public void addToTheLast(ListNode node) { method isPalindrome (line 27) | public boolean isPalindrome(ListNode head) { method reverse (line 49) | public ListNode reverse(ListNode head) { class PalindromLinkedList (line 62) | class PalindromLinkedList{ method main (line 63) | public static void main(String args[]){ FILE: Data-Structures/LinkedList/Singly_Linked_List/LinkedList.cs class LinkedList (line 1) | class LinkedList method LinkedList (line 6) | public LinkedList(T value, LinkedList next) method LinkedList (line 12) | public LinkedList(T value) : this(value, null) {} method GetValue (line 14) | public T GetValue() method GetNext (line 19) | public LinkedList GetNext() method SetValue (line 24) | public void SetValue(T value) method SetNext (line 29) | public void SetNext(LinkedList next) FILE: Data-Structures/LinkedList/Singly_Linked_List/LinkedList.java class LinkedList (line 1) | class LinkedList method LinkedList (line 6) | public LinkedList(T value, LinkedList next) { method LinkedList (line 11) | public LinkedList(T value) { method GetValue (line 15) | public T GetValue() { method GetNext (line 19) | public LinkedList GetNext() { method SetValue (line 23) | public void SetValue(T value) { method SetNext (line 27) | public void SetNext(LinkedList next) { FILE: Data-Structures/LinkedList/Singly_Linked_List/LinkedList.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, dataval=None): class SLinkedList (line 7) | class SLinkedList: method __init__ (line 8) | def __init__(self): FILE: Data-Structures/LinkedList/Singly_Linked_List/LinkedListAndOperations.cpp type list (line 5) | struct list{ function display_list (line 14) | void display_list(){ function insert_at_first (line 29) | void insert_at_first(int z){ function insert_at_last (line 42) | void insert_at_last(int n){ function insert_at_mid (line 58) | void insert_at_mid(int a,int b){ function delete_first (line 74) | void delete_first(){ function delete_last (line 80) | void delete_last(){ function delete_any (line 96) | void delete_any(int a){ function count_list (line 115) | void count_list(){ function get_max_from_list (line 131) | void get_max_from_list(){ function reverse_list (line 148) | void reverse_list(){ function main (line 161) | int main(){ FILE: Data-Structures/LinkedList/Singly_Linked_List/LoopDetection.cpp type Node (line 38) | struct Node { type Node (line 40) | struct Node function Node (line 42) | Node* newNode(int key) type Node (line 40) | struct Node function printList (line 49) | void printList(Node* head) function distance (line 57) | int distance(Node* first, Node* last) function detectLoop (line 68) | bool detectLoop(Node* head) function main (line 88) | int main() FILE: Data-Structures/LinkedList/Singly_Linked_List/MiddleElementLL.cpp type Node (line 4) | struct Node{ type Node (line 6) | struct Node function main (line 9) | int main() { FILE: Data-Structures/LinkedList/Singly_Linked_List/MiddleElementLinkedList.java class Main (line 2) | public class Main class Node (line 5) | class Node{ method Node (line 8) | Node(int data){ method insert_At_beginning (line 13) | public void insert_At_beginning(int data) { method isEmpty (line 26) | public boolean isEmpty() method print (line 32) | public void print() { method insert_At_End (line 41) | public void insert_At_End(int data) method delete_From_Beginning (line 56) | public void delete_From_Beginning() method delete_From_End (line 62) | public void delete_From_End() method delete_At_Position (line 76) | public void delete_At_Position(int c) method insert_At_Position (line 92) | public void insert_At_Position(int c,int data) method count (line 113) | public void count() method main (line 123) | public static void main(String[] args) { FILE: Data-Structures/LinkedList/Singly_Linked_List/Palindrome.ts class LinkedList (line 1) | class LinkedList { method constructor (line 3) | constructor(item: LinkedListItem) { method append (line 8) | append(val: number) { method prepend (line 27) | prepend(val: number) { method insert (line 36) | insert(val: number, previousItem: LinkedListItem) { method delete (line 56) | delete(val: number) { method showInArray (line 85) | showInArray() { method isPalindrome (line 102) | isPalindrome(head: any) { class LinkedListItem (line 118) | class LinkedListItem { method constructor (line 122) | constructor(val: number) { FILE: Data-Structures/LinkedList/Singly_Linked_List/PalindromeLinkedList.cpp class Node (line 4) | class Node method Node (line 8) | Node(int d) function isPalin (line 15) | bool isPalin(Node *head) function main (line 48) | int main() FILE: Data-Structures/LinkedList/Singly_Linked_List/PalindromeLinkedList.js class LinkedListNode (line 2) | class LinkedListNode { method constructor (line 3) | constructor(char, next) { class LinkedList (line 8) | class LinkedList { method constructor (line 9) | constructor(chars) { method isPalindrome (line 19) | isPalindrome() { FILE: Data-Structures/LinkedList/Singly_Linked_List/Remove duplicates from linked_list.c type node (line 4) | 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 main (line 15) | int main() function dup_delete (line 34) | void dup_delete(struct node **head) function create (line 65) | void create(struct node **head) function display (line 92) | void display(struct node *p) function release (line 102) | void release(struct node **head) FILE: Data-Structures/LinkedList/Singly_Linked_List/Remove duplicates in a Linked List.cpp class Node (line 3) | class Node{ function create (line 8) | void create(int size){ function deleteNum (line 33) | void deleteNum(){ function display (line 49) | void display(){ function main (line 60) | int main() FILE: Data-Structures/LinkedList/Singly_Linked_List/Remove_Duplicates_in_LL.py class Node (line 5) | class Node: method __init__ (line 9) | def __init__(self, data): class LinkedList (line 13) | class LinkedList: method __init__ (line 16) | def __init__(self): method push (line 21) | def push(self, new_data): method deleteNode (line 29) | def deleteNode(self, key): method printList (line 63) | def printList(self): method removeDuplicates (line 71) | def removeDuplicates(self): FILE: Data-Structures/LinkedList/Singly_Linked_List/Reversed_Linked_List/ReversedLinkedList.js class LinkedListNode (line 1) | class LinkedListNode { method constructor (line 3) | constructor(value){ class LinkedList (line 9) | class LinkedList { method constructor (line 11) | constructor(){ method push (line 16) | push(value){ method reverse (line 24) | reverse() { FILE: Data-Structures/LinkedList/Singly_Linked_List/Reversed_Linked_List/reverseLinkedList.c type NODE (line 5) | typedef struct Node function NODE (line 12) | NODE *insert(NODE* head, int val) function NODE (line 21) | NODE *reverse(NODE *head) function print_ (line 37) | void print_(NODE *head) function main (line 48) | int main() FILE: Data-Structures/LinkedList/Singly_Linked_List/Sublist_Search.rb class LinkedList (line 2) | class LinkedList class Node (line 5) | class Node method initialize (line 9) | def initialize(val, nextNode) method initialize (line 16) | def initialize(val) method insert (line 21) | def self.insert(node, val) method search (line 36) | def self.search(listToFind, listBeingSearched) method prettyPrint (line 85) | def self.prettyPrint(node) FILE: Data-Structures/LinkedList/Singly_Linked_List/linked list.c type node (line 8) | struct node{ type node (line 12) | struct node function main (line 18) | int main() function create (line 44) | void create() function display (line 66) | void display() function insert_beg (line 74) | void insert_beg() function insert_end (line 85) | void insert_end() function insert_at_loc (line 100) | void insert_at_loc() function count_node (line 117) | void count_node() function delete (line 128) | void delete() FILE: Data-Structures/LinkedList/Singly_Linked_List/linked.cpp type Node (line 6) | struct Node function main (line 18) | int main() function Node (line 64) | Node*Create_New_Node(int n) function Insert_End (line 71) | void Insert_End(Node*np) function Display (line 82) | void Display(Node*np) function DelNode (line 92) | void DelNode() function Search (line 106) | void Search(Node*np) FILE: Data-Structures/LinkedList/Singly_Linked_List/linkedlist.cpp type node (line 15) | struct node type node (line 21) | struct node class single_llist (line 33) | class single_llist method single_llist (line 59) | single_llist() function main (line 77) | main() function node (line 239) | node *single_llist::create_node(int value) type node (line 21) | struct node type node (line 289) | struct node type node (line 21) | struct node type node (line 337) | struct node type node (line 21) | struct node type node (line 377) | struct node type node (line 21) | struct node type node (line 471) | struct node type node (line 21) | struct node type node (line 543) | struct node type node (line 21) | struct node type node (line 637) | struct node type node (line 21) | struct node type node (line 709) | struct node type node (line 21) | struct node type node (line 751) | struct node type node (line 21) | struct node type node (line 811) | struct node type node (line 21) | struct node FILE: Data-Structures/LinkedList/Singly_Linked_List/merge2sortedlinkedlists.cpp type node (line 5) | struct node { type node (line 7) | struct node function node (line 9) | node *createList(int *arr, int n){ type node (line 7) | struct node function displayList (line 22) | void displayList(node *head){ function node (line 29) | node *mergeSortedLists(node *head1, node *head2){ type node (line 7) | struct node function main (line 46) | int main(){ FILE: Data-Structures/LinkedList/Singly_Linked_List/middle.ts function main (line 1) | function main() { class NodeCell (line 11) | class NodeCell { method constructor (line 19) | constructor(val: string){ class SinglyLinkedList (line 25) | class SinglyLinkedList { method constructor (line 32) | constructor(){ method push (line 41) | push(...values: string[]){ method findMiddle (line 58) | findMiddle(): NodeCell{ FILE: Data-Structures/LinkedList/detect_cycle.rb class ListNode (line 2) | class ListNode method initialize (line 4) | def initialize(val) function detect_cycle (line 13) | def detect_cycle(head) FILE: Data-Structures/LinkedList/sparce matrix/sparce addition.cpp type node (line 3) | struct node type node (line 6) | struct node function create (line 8) | void create(struct node **h) function display1 (line 26) | void display1(struct node *h) function display2 (line 35) | void display2(struct node *h) function add (line 61) | void add(struct node *h1,struct node *h2,struct node **h3) function main (line 109) | int main() FILE: Data-Structures/Queue/Circular-Queue/circular_queue.c type queue (line 5) | struct queue function main (line 16) | void main(){ function enqueue (line 38) | void enqueue(int x) function dequeue (line 53) | void dequeue() function display (line 77) | void display() FILE: Data-Structures/Queue/Circular-Queue/circular_queue.cs class CircularQueue (line 9) | public class CircularQueue method CircularQueue (line 16) | public CircularQueue(int MaxSize) method ResetQueue (line 26) | public void ResetQueue() method Enqueue (line 47) | public bool Enqueue(object obj) method Dequeue (line 64) | public object Dequeue() method IsQueueFull (line 79) | private bool IsQueueFull() FILE: Data-Structures/Queue/Circular-Queue/circular_queue_LL.c type node (line 4) | struct node{ type queue (line 8) | struct queue{ function enqueue (line 13) | void enqueue(struct queue *q){ function dequeue (line 26) | void dequeue(struct queue *q){ function display (line 43) | void display(struct queue *q){ function main (line 52) | int main(){ FILE: Data-Structures/Queue/Circular-Queue/circular_queue_array_implementation.c function isFull (line 4) | int isFull(int size){ function isEmpty (line 9) | int isEmpty(){ function display (line 15) | void display(int queue[],int size){ function enqueue (line 32) | void enqueue(int queue[],int element,int size){ function dequeue (line 49) | void dequeue(int queue[]){ function main (line 65) | int main(){ FILE: Data-Structures/Queue/Circular-Queue/cirqueue.cpp function main (line 14) | int main() function enqueue (line 49) | void enqueue(int temp) function dequeue (line 72) | void dequeue() function display_CQ (line 91) | void display_CQ() FILE: Data-Structures/Queue/Deque/Deque.cpp type node (line 5) | struct node method node (line 11) | node(int x, node * pr, node * nx){ type myDeque (line 18) | struct myDeque method push (line 25) | void push(int x) { method myDeque (line 33) | myDeque() method push_back (line 40) | void push_back(int x) { method push_front (line 53) | void push_front(int x) { method pop_back (line 66) | void pop_back() { method pop_front (line 79) | void pop_front() { method front (line 91) | void front() { method back (line 98) | void back() { method size (line 105) | int size() { method clear (line 108) | void clear() { method empty (line 113) | bool empty() { function main (line 119) | int main() FILE: Data-Structures/Queue/Deque/Deque.java class Deque (line 4) | public class Deque{ method insertFront (line 8) | public void insertFront(int item){ method insertRear (line 15) | public void insertRear(int item){ method removeFront (line 22) | public void removeFront(){ method removeRear (line 33) | public void removeRear(){ method peakFront (line 44) | public int peakFront(){ method peakRear (line 51) | public int peakRear(){ method main (line 57) | public static void main(String a[]){ FILE: Data-Structures/Queue/Deque/Deque.js class Deque (line 1) | class Deque { method constructor (line 2) | constructor() { method addFront (line 6) | addFront(value) { method removeFront (line 11) | removeFront() { method peekFront (line 18) | peekFront() { method addBack (line 22) | addBack(value) { method removeBack (line 27) | removeBack() { method peekBack (line 34) | peekBack() { FILE: Data-Structures/Queue/Deque/Deque.py class Deque (line 2) | class Deque(): method __init__ (line 5) | def __init__(self, data=None): method append (line 11) | def append(self, item): method appendleft (line 15) | def appendleft(self, item): method pop (line 19) | def pop(self): method popleft (line 23) | def popleft(self): method index (line 27) | def index(self, item, start, stop): method insert (line 33) | def insert(self,idx,item): method remove (line 37) | def remove(self, item): method count (line 41) | def count(self, item): method extend (line 49) | def extend(self, list_2): method extendleft (line 54) | def extendleft(self, list_2): method rotate (line 59) | def rotate(self,idx): method clear (line 63) | def clear(self): method copy (line 67) | def copy(self): method __str__ (line 71) | def __str__(self): method __iter__ (line 75) | def __iter__(self): FILE: Data-Structures/Queue/Deque/Deque.ts class DequeNode (line 2) | class DequeNode { method constructor (line 9) | constructor(data: any) { class Deque (line 17) | class Deque { method constructor (line 22) | constructor() { method print (line 28) | print() { method peekFront (line 39) | peekFront() { method appendFront (line 46) | appendFront(data: any) { method removeFront (line 59) | removeFront() { method peekBack (line 74) | peekBack() { method appendBack (line 80) | appendBack(data: any) { method removeBack (line 93) | removeBack() { FILE: Data-Structures/Queue/Priority-Queue/Priority-Queue.cpp type node (line 5) | struct node type node (line 9) | struct node class Priority_Queue (line 12) | class Priority_Queue method Priority_Queue (line 17) | Priority_Queue() method insert (line 22) | void insert(int item, int priority) method del (line 44) | void del() method display (line 59) | void display() function main (line 78) | int main() FILE: Data-Structures/Queue/Priority-Queue/PriorityQueue.php class priorityQueue (line 5) | class priorityQueue extends SplPriorityQueue { method compare (line 9) | public function compare($p1, $p2) { FILE: Data-Structures/Queue/Priority-Queue/priorityQueue.js class PriorityQueue (line 1) | class PriorityQueue { method constructor (line 2) | constructor() { method enqueue (line 7) | enqueue(element, priority) { method dequeue (line 26) | dequeue() { method peek (line 31) | peek() { method isEmpty (line 36) | isEmpty() { method size (line 41) | size() { method print (line 46) | print() { FILE: Data-Structures/Queue/QueueUsingArray.c function main (line 9) | void main() function enqueue (line 23) | void enqueue(int Queue[],int temp) function dequeue (line 41) | void dequeue(int Queue[]) function display_Queue (line 57) | void display_Queue(int Queue[]) FILE: Data-Structures/Queue/QueueUsingArray.cpp type node (line 3) | struct node { type node (line 5) | struct node type node (line 7) | struct node type node (line 5) | struct node type node (line 8) | struct node type node (line 5) | struct node type node (line 9) | struct node type node (line 5) | struct node function Insert (line 10) | void Insert() { function Delete (line 27) | void Delete() { function Display (line 46) | void Display() { function main (line 59) | int main() { FILE: Data-Structures/Queue/QueueUsingArray.go function enqueue (line 9) | func enqueue(queue []int, ele int) []int { function dequeue (line 14) | func dequeue() int { function main (line 22) | func main() { FILE: Data-Structures/Queue/QueueUsingArray.java class QueueUsingArray (line 2) | public class QueueUsingArray { method main (line 3) | public static void main(String[] args) { class Queue (line 21) | class Queue{ method Queue (line 24) | Queue(int c){ method queueEnque (line 30) | static void queueEnque(int data){ method queueDeque (line 42) | static void queueDeque(){ method queueDisplay (line 57) | static void queueDisplay(){ method queuefront (line 68) | static void queuefront(){ FILE: Data-Structures/Queue/QueueUsingArray.js class Queue (line 1) | class Queue { method constructor (line 3) | constructor(initial=[]) { method put (line 9) | put(element) { method get (line 13) | get() { method print (line 17) | print() { FILE: Data-Structures/Queue/QueueUsingArray.py class FifoList (line 1) | class FifoList: method __init__ (line 2) | def __init__(self): method append (line 6) | def append(self, data): method pop (line 9) | def pop(self): method display (line 14) | def display(self): FILE: Data-Structures/Queue/QueueUsingArray.rb class Queue (line 1) | class Queue method initialize (line 6) | def initialize(items = []) method enqueue (line 14) | def enqueue(element) method dequeue (line 26) | def dequeue method front (line 40) | def front method back (line 44) | def back method empty? (line 48) | def empty? method clear (line 52) | def clear method each (line 58) | def each FILE: Data-Structures/Queue/QueueUsingLL.c type qlist (line 3) | struct qlist type qlist (line 7) | struct qlist type qlist (line 8) | struct qlist type qlist (line 8) | struct qlist type qlist (line 9) | struct qlist type qlist (line 9) | struct qlist function main (line 10) | int main() function enqueue (line 31) | void enqueue(struct qlist **pfront,struct qlist **prear,int item) function dequeue (line 44) | int dequeue(struct qlist **pfront,struct qlist**prear) FILE: Data-Structures/Queue/QueueUsingLL.cpp type node (line 6) | struct node function node (line 13) | node *add(node *rear, int val) function node (line 26) | node *del(node *front, int &val) function showqueue (line 45) | void showqueue(node *front) function main (line 65) | int main() FILE: Data-Structures/Queue/QueueUsingLL.cs class SimpleQueue (line 7) | class SimpleQueue method Enqueue (line 11) | public void Enqueue(int val) { method Dequeue (line 15) | public int Dequeue() { method Peek (line 20) | public int Peek() { method Size (line 24) | public int Size() { method IsEmpty (line 28) | public bool IsEmpty() { method Print (line 32) | public void Print() method Main (line 37) | static void Main(string[] args) FILE: Data-Structures/Queue/QueueUsingLL.php class Node (line 6) | class Node{ class Queue (line 15) | class Queue{ method isEmpty (line 20) | public function isEmpty(){ method enqueue (line 26) | public function enqueue($value){ method dequeue (line 39) | public function dequeue(){ method show (line 51) | public function show(){ FILE: Data-Structures/Queue/QueueUsingStacks.cpp function push1 (line 9) | void push1(int data) function pop1 (line 23) | int pop1() function push2 (line 38) | void push2(int x) function pop2 (line 53) | int pop2() function enqueue (line 59) | void enqueue(int x) function dequeue (line 64) | void dequeue() function display (line 87) | void display() function main (line 94) | void main() FILE: Data-Structures/Stack/Infix_to_prefix_postfix.cpp type node (line 22) | struct node type eval_node (line 28) | struct eval_node class stack (line 34) | class stack method stack (line 39) | stack() class eval_stack (line 47) | class eval_stack method eval_stack (line 52) | eval_stack() function disp (line 105) | void disp(char b[]) function rev (line 115) | void rev(char a[],int n) function seq (line 139) | int seq(char a) function result (line 153) | int result(int a1,int a2,char op) function in_pos (line 165) | void in_pos(char a[],char b[]) function in_pre (line 246) | void in_pre(char a[],char b[]) function eval_pos (line 255) | int eval_pos(char a[]) function eval_pre (line 282) | int eval_pre(char a[]) function main (line 308) | int main() FILE: Data-Structures/Stack/StackUsingArray.c function push (line 8) | void push() { function pop (line 22) | void pop() { function clear (line 34) | void clear() { function isEmpty (line 40) | void isEmpty() { function topmost (line 49) | void topmost() { function seek (line 58) | void seek() { function display (line 75) | void display() { function instructions (line 86) | void instructions() { function main (line 98) | int main() { FILE: Data-Structures/Stack/StackUsingArray.cpp class stack (line 4) | class stack{ method stack (line 11) | stack(){ method isEmpty (line 22) | bool isEmpty(){ method isFull (line 33) | bool isFull(){ method push (line 44) | void push(int i){ method pop (line 56) | int pop(){ method count (line 71) | int count(){ method peek (line 75) | int peek(int i){ method change (line 79) | void change(int val, int pos){ method display (line 84) | void display(){ function main (line 94) | int main() FILE: Data-Structures/Stack/StackUsingArray.cs class Program (line 6) | class Program method Main (line 8) | static void Main(string[] args) class Stack (line 26) | class Stack method Stack (line 31) | public Stack() method Push (line 36) | public void Push(int value) method Pop (line 42) | public void Pop() method Peek (line 54) | public void Peek() method isEmpty (line 63) | public bool isEmpty() FILE: Data-Structures/Stack/StackUsingArray.go type stack (line 6) | type stack method push (line 8) | func (s stack) push(v int) stack { method pop (line 12) | func (s stack) pop() (stack, int) { method size (line 17) | func (s stack) size() int { function main (line 21) | func main(){ FILE: Data-Structures/Stack/StackUsingArray.java class Stack (line 2) | class Stack method isEmpty (line 9) | boolean isEmpty() method Stack (line 14) | Stack() method push (line 18) | boolean push (Scanner sc) method pop (line 36) | boolean pop () method display (line 51) | void display () class Stack_Operations (line 61) | public class Stack_Operations { method main (line 62) | public static void main(String[] args) { FILE: Data-Structures/Stack/StackUsingArray.js class Stack (line 1) | class Stack { method constructor (line 2) | constructor() { method push (line 6) | push(value) { method pop (line 10) | pop() { method peek (line 19) | peek() { method isEmpty (line 27) | isEmpty() { FILE: Data-Structures/Stack/StackUsingArray.php class Stack (line 3) | class Stack method __construct (line 7) | public function __construct($size = 50) { method push (line 13) | public function push($data) {//push element into stack method pop (line 23) | public function pop() {//pop element from stack FILE: Data-Structures/Stack/StackUsingArray.rb class DynamicStack (line 1) | class DynamicStack method initialize (line 2) | def initialize method is_empty? (line 6) | def is_empty? method push (line 10) | def push(value) method pop (line 14) | def pop method peek (line 18) | def peek class StaticStack (line 23) | class StaticStack method initialize (line 25) | def initialize(capacity) method is_empty? (line 31) | def is_empty? method push (line 35) | def push(value) method pop (line 41) | def pop method peek (line 48) | def peek method is_full? (line 54) | def is_full? FILE: Data-Structures/Stack/StackUsingLL.cpp type node (line 5) | struct node method node (line 10) | node(int x, node * pr){ type myStack (line 16) | struct myStack method myStack (line 25) | myStack() method push (line 31) | void push(int x) { method pop (line 37) | void pop() { method back (line 49) | void back() { method size (line 56) | int size() { method clear (line 59) | void clear() { method empty (line 63) | bool empty() { function main (line 69) | int main() FILE: Data-Structures/Stack/StackUsingLL.go type Stack (line 9) | type Stack method IsEmpty (line 28) | func (s *Stack) IsEmpty() bool { method Push (line 33) | func (s *Stack) Push(value string) { method Pop (line 39) | func (s *Stack) Pop() (string, error) { method Peek (line 52) | func (s *Stack) Peek() (string, error) { function main (line 11) | func main() { FILE: Data-Structures/Stack/StackUsingLL.java class StackUsingLL (line 3) | public class StackUsingLL { class Node (line 5) | class Node { method Node (line 10) | public Node(int val, int min) { method push (line 17) | public void push(int x) { // O(1) method pop (line 28) | public void pop() { method peek (line 34) | public int peek() { method getMin (line 41) | public int getMin() { method display (line 48) | public void display() { method operation (line 64) | public static void operation(StackUsingLL stack) { method main (line 109) | public static void main(String[] args) { FILE: Data-Structures/Stack/StackUsingLL.js class Node (line 1) | class Node { method constructor (line 2) | constructor(data) { class Stack (line 8) | class Stack { method constructor (line 9) | constructor() { method isEmpty (line 13) | isEmpty() { method push (line 17) | push(data) { method pop (line 27) | pop() { method peek (line 37) | peek() { FILE: Data-Structures/Stack/StackUsingLL.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self,data): class Stack (line 6) | class Stack: method __init__ (line 8) | def __init__(self): method isempty (line 11) | def isempty(self): method push (line 17) | def push(self,data): method pop (line 27) | def pop(self): method peek (line 39) | def peek(self): method display (line 47) | def display(self): FILE: Data-Structures/Stack/stackUsingLinkedList.c type node (line 3) | struct node type node (line 8) | struct node function push (line 9) | void push() function pop (line 37) | void pop() function display (line 53) | void display() function main (line 71) | int main() FILE: Data-Structures/Stack/stackusingLL.c type node (line 3) | struct node{ type stack (line 7) | struct stack{ type node (line 11) | struct node type node (line 12) | struct node type node (line 12) | struct node type node (line 12) | struct node type stack (line 18) | struct stack type stack (line 19) | struct stack type stack (line 19) | struct stack type stack (line 19) | struct stack function push (line 24) | void push(struct node **head){ function pop (line 35) | void pop(struct node **head){ function top_element (line 46) | void top_element(struct node *head){ function print_stack (line 49) | void print_stack(struct node *head){ function main (line 58) | int main(){ FILE: Data-Structures/Tree/23-Tree/23Tree.cpp type TreeNode (line 6) | struct TreeNode{ type TreeNode (line 10) | struct TreeNode function printInorder (line 18) | void printInorder(TreeNode* root){ function printPreorder (line 30) | void printPreorder(TreeNode* root){ function printPostorder (line 42) | void printPostorder(TreeNode* root){ function TreeNode (line 54) | TreeNode* newNode(int key){ type TreeNode (line 10) | struct TreeNode function TreeNode (line 64) | TreeNode* search(TreeNode* root, int key){ type TreeNode (line 10) | struct TreeNode function isOverflow (line 77) | bool isOverflow(TreeNode* node){ function fixOverflow (line 82) | void fixOverflow(TreeNode *node) { function insert (line 131) | void insert(int key) { function isUnderflow (line 167) | bool isUnderflow(TreeNode* node){ function canDonate (line 172) | bool canDonate(TreeNode* node){ function isEmpty (line 176) | bool isEmpty(TreeNode* node){ function isRoot (line 180) | bool isRoot(TreeNode* node){ function fixUnderflow (line 185) | void fixUnderflow(TreeNode *node) { function TreeNode (line 288) | TreeNode* getMin(TreeNode* root){ type TreeNode (line 10) | struct TreeNode function TreeNode (line 294) | TreeNode* getMax(TreeNode* root){ type TreeNode (line 10) | struct TreeNode function isLeaf (line 302) | bool isLeaf(TreeNode* node){ function deleteNode (line 307) | void deleteNode(int key) { function main (line 342) | int main(){ FILE: Data-Structures/Tree/23-Tree/23Tree.py class Node (line 1) | class Node(object): method __init__ (line 5) | def __init__(self, data, parent=None): method insert (line 10) | def insert(self, value): method split (line 15) | def split(self): method add (line 71) | def add(self, value): method search (line 89) | def search(self, value): method element (line 105) | def element(self, value): FILE: Data-Structures/Tree/AVL-Tree/AVL_Tree.java class AVLNode (line 8) | class AVLNode method AVLNode (line 15) | public AVLNode() method AVLNode (line 23) | public AVLNode(int n) class AVLTree (line 33) | class AVLTree method AVLTree (line 38) | public AVLTree() method isEmpty (line 43) | public boolean isEmpty() method makeEmpty (line 48) | public void makeEmpty() method insert (line 53) | public void insert(int data) method height (line 58) | private int height(AVLNode t ) method max (line 63) | private int max(int lhs, int rhs) method insert (line 68) | private AVLNode insert(int x, AVLNode t) method rotateWithLeftChild (line 96) | private AVLNode rotateWithLeftChild(AVLNode k2) method rotateWithRightChild (line 107) | private AVLNode rotateWithRightChild(AVLNode k1) method doubleWithLeftChild (line 119) | private AVLNode doubleWithLeftChild(AVLNode k3) method doubleWithRightChild (line 127) | private AVLNode doubleWithRightChild(AVLNode k1) method countNodes (line 133) | public int countNodes() method countNodes (line 137) | private int countNodes(AVLNode r) method search (line 150) | public boolean search(int val) method search (line 154) | private boolean search(AVLNode r, int val) method inorder (line 174) | public void inorder() method inorder (line 178) | private void inorder(AVLNode r) method preorder (line 188) | public void preorder() method preorder (line 192) | private void preorder(AVLNode r) method postorder (line 202) | public void postorder() method postorder (line 206) | private void postorder(AVLNode r) class AVLTreeTest (line 218) | public class AVLTreeTest method main (line 220) | public static void main(String[] args) FILE: Data-Structures/Tree/AVL-Tree/AVL_Tree.py class TreeNode (line 3) | class TreeNode(object): method __init__ (line 4) | def __init__(self, key): class AVLTree (line 11) | class AVLTree(object): method insert_node (line 12) | def insert_node(self, root, key): method delete_node (line 41) | def delete_node(self, root, key): method leftRotate (line 80) | def leftRotate(self, z): method rightRotate (line 90) | def rightRotate(self, z): method getHeight (line 102) | def getHeight(self, root): method getBalance (line 107) | def getBalance(self, root): method getMinValueNode (line 112) | def getMinValueNode(self, root): method preOrder (line 117) | def preOrder(self, root): method printHelper (line 125) | def printHelper(self, currPtr, indent, last): FILE: Data-Structures/Tree/AVL-Tree/AVLtree.c type Node (line 7) | struct Node { function height (line 17) | int height(struct Node *N) { function max (line 23) | int max(int a, int b) { type Node (line 28) | struct Node type Node (line 29) | struct Node type Node (line 29) | struct Node type Node (line 30) | struct Node type Node (line 39) | struct Node type Node (line 39) | struct Node type Node (line 40) | struct Node type Node (line 41) | struct Node type Node (line 53) | struct Node type Node (line 53) | struct Node type Node (line 54) | struct Node type Node (line 55) | struct Node function getBalance (line 67) | int getBalance(struct Node *N) { type Node (line 74) | struct Node type Node (line 74) | struct Node type Node (line 111) | struct Node type Node (line 111) | struct Node type Node (line 112) | struct Node type Node (line 121) | struct Node type Node (line 121) | struct Node type Node (line 134) | struct Node type Node (line 143) | struct Node function printPreOrder (line 180) | void printPreOrder(struct Node *root) { function InOrder (line 189) | void InOrder(struct Node *root) { function PostOrder (line 198) | void PostOrder(struct Node *root) { function main (line 206) | int main() { FILE: Data-Structures/Tree/AVL-Tree/avl_tree.py class Node (line 39) | class Node(object): method __init__ (line 42) | def __init__( class AVL_Tree (line 62) | class AVL_Tree(object): method getHeight (line 66) | def getHeight(self, node): method getBalanceFactor (line 75) | def getBalanceFactor(self, node): method leftRotate (line 84) | def leftRotate(self, node): method rightRotate (line 113) | def rightRotate(self, node): method insertNode (line 143) | def insertNode(self, rootNode, value): FILE: Data-Structures/Tree/Binary-Indexed-Tree/Binary-Indexed-Tree.c function createBIT (line 31) | void createBIT(int ftree[], int n) { function update (line 41) | void update(int ftree[], int n, int val, int i) { function getSum (line 49) | int getSum(int ftree[], int n, int i) { function main (line 58) | int main() { FILE: Data-Structures/Tree/Binary-Indexed-Tree/Binary-Indexed-Tree.go type BITree (line 12) | type BITree method Update (line 24) | func (b BITree) Update(i, val int) { method GetSum (line 33) | func (b BITree) GetSum(i int) (sum int) { function NewBITree (line 15) | func NewBITree(array []int) BITree { function main (line 42) | func main() { FILE: Data-Structures/Tree/Binary-Indexed-Tree/Binary-Indexed-Tree.java class Binary_Index_Tree (line 32) | class Binary_Index_Tree { method createBIT (line 38) | static void createBIT(int[] ftree, int n) { method update (line 48) | static void update(int[] ftree, int n, int val, int i) { method getSum (line 56) | static int getSum(int[] ftree, int n, int i) { method main (line 65) | public static void main(String[] args) throws IOException{ FILE: Data-Structures/Tree/Binary-Indexed-Tree/Binary-Indexed-Tree.py class BITree (line 4) | class BITree: method __init__ (line 6) | def __init__(self, a: list): method __getitem__ (line 12) | def __getitem__(self, i): method update (line 16) | def update(self, i: int, val: int): method getSum (line 22) | def getSum(self, i: int): FILE: Data-Structures/Tree/Binary-Search-Tree/BST.cs class Node (line 4) | class Node class BinaryTree (line 11) | class BinaryTree method Add (line 15) | public bool Add(int value) method Find (line 49) | public Node Find(int value) method Remove (line 54) | public void Remove(int value) method Remove (line 59) | private Node Remove(Node parent, int key) method MinValue (line 85) | private int MinValue(Node node) method Find (line 98) | private Node Find(int value, Node parent) method GetTreeDepth (line 112) | public int GetTreeDepth() method GetTreeDepth (line 117) | private int GetTreeDepth(Node parent) method TraversePreOrder (line 122) | public void TraversePreOrder(Node parent) method TraverseInOrder (line 132) | public void TraverseInOrder(Node parent) method TraversePostOrder (line 142) | public void TraversePostOrder(Node parent) method Main (line 152) | static void Main(string[] args) { FILE: Data-Structures/Tree/Binary-Search-Tree/BST_balanced.cpp type node (line 6) | struct node method node (line 12) | node(int k) { type BST (line 19) | struct BST method BST (line 24) | BST() { method node (line 29) | node * add(node * root, int x) { method inorder (line 50) | void inorder(node * x) { method balance (line 58) | int balance(node * root, int h) { method isBalanced (line 66) | bool isBalanced(node * x) { function main (line 71) | int main() { FILE: Data-Structures/Tree/Binary-Search-Tree/BinarySearchTree.go type treeNode (line 5) | type treeNode struct type tree (line 11) | type tree struct method reset (line 15) | func (binaryTree *tree) reset() { method insert (line 19) | func (binaryTree *tree) insert(value int) { method insertRec (line 23) | func (binaryTree *tree) insertRec(node *treeNode, value int) *treeNode { method find (line 42) | func (binaryTree *tree) find(value int) error { method findRec (line 50) | func (binaryTree *tree) findRec(node *treeNode, value int) *treeNode { method inorder (line 63) | func (binaryTree *tree) inorder() { method inorderRec (line 67) | func (binaryTree *tree) inorderRec(node *treeNode) { function main (line 75) | func main() { FILE: Data-Structures/Tree/Binary-Search-Tree/BinarySearchTree.java class BinarySearchTree (line 4) | public class BinarySearchTree { method BinarySearchTree (line 6) | public BinarySearchTree(){ method isEmpty (line 9) | public boolean isEmpty(){ method deleteByCopying (line 12) | public void deleteByCopying(int deletevalue){ method deleteByMerging (line 48) | public void deleteByMerging(int deleteValue){ method preorderTravelsal (line 92) | public void preorderTravelsal(){ method breadthFirstTraversal (line 109) | public void breadthFirstTraversal(){ method inorderTraversalRecursion (line 126) | public void inorderTraversalRecursion(TreeNode p){ method preorderTraversalRecursion (line 133) | public void preorderTraversalRecursion(TreeNode p){ method postorderTraversalRecursion (line 140) | public void postorderTraversalRecursion(TreeNode p){ method insert (line 147) | public void insert(int newInfo){ method search (line 175) | public TreeNode search(int info){ method countNode (line 198) | public int countNode(TreeNode t){ method countLeaves (line 206) | public int countLeaves(TreeNode t){ method countRightChildren (line 217) | public int countRightChildren(TreeNode t){ method getHeight (line 233) | public int getHeight(TreeNode t){ method deleteLeaves (line 242) | public void deleteLeaves(TreeNode t){ method breadthFirst (line 266) | public void breadthFirst(){ method preorder (line 283) | public void preorder(TreeNode p){ method inorder (line 290) | public void inorder(TreeNode p){ method postorder (line 297) | public void postorder(TreeNode p){ method iterativePreorder (line 304) | public void iterativePreorder(){ method iterativeInorder (line 321) | public void iterativeInorder(){ method iterativeLastorder (line 346) | public void iterativeLastorder(){ class TreeNode (line 364) | class TreeNode { method TreeNode (line 367) | public TreeNode(int info){ method TreeNode (line 370) | public TreeNode(int info,TreeNode left,TreeNode right){ FILE: Data-Structures/Tree/Binary-Search-Tree/Binary_Search_Tree.cpp type dll (line 24) | struct dll function dll (line 31) | dll *BSTinsert(dll *root,int x) //Inserting node in BST function levelorder (line 64) | void levelorder(dll *root) //Print the node in levelorder form function Rpreorder (line 91) | void Rpreorder(dll *root) //Recursive Postorder function NRpreorder (line 101) | void NRpreorder(dll *root) //Iterative Preorder function Rinorder (line 119) | void Rinorder(dll *root) //Recursive Inorder function NRinorder (line 129) | void NRinorder(dll *root) //Iterative Inorder function Rpostorder (line 146) | void Rpostorder(dll *root) //Recursive Postorder function NRpostorder (line 159) | void NRpostorder(dll *root) //Iterative Postorder function BSTheight (line 192) | int BSTheight(dll *root) //Height of BST function dll (line 217) | dll* f_min(dll *root) //Find Minimum element from root function dll (line 227) | dll *f_max(dll *root) //Find Maximum element from root function search (line 237) | bool search(dll *root,int x) //Search an element in BST function dll (line 260) | dll *bstdelete(dll *root, int x) //Delete the node from BST function dll (line 304) | dll *mirr(dll *root) //Mirror image of the BST function dll (line 324) | dll *nd_copy(dll *root) function par_chld (line 337) | void par_chld(dll *root) //Print all parents and their Children function leaf_nd (line 379) | void leaf_nd(dll *root) //Print all leafnode in BST function main (line 397) | int main() //main function FILE: Data-Structures/Tree/Binary-Search-Tree/Binary_Search_Tree.py class BSTNode (line 3) | class BSTNode: method __init__ (line 4) | def __init__(selfNode, nodeData): # Node Structure method insert (line 12) | def insert(selfNode, node): method replace_node_of_parent (line 28) | def replace_node_of_parent(selfNode, new_node): method find_min (line 45) | def find_min(selfNode): method remove (line 51) | def remove(selfNode): method search (line 65) | def search(selfNode, nodeData): method inorder (line 80) | def inorder(selfNode): method postorder (line 89) | def postorder(selfNode): method preorder (line 98) | def preorder(selfNode): class BSTree (line 106) | class BSTree: # Structure of Binary Search Tree method __init__ (line 107) | def __init__(selfNode): method inorder (line 110) | def inorder(selfNode): method preorder (line 114) | def preorder(selfNode): method postorder (line 118) | def postorder(selfNode): method add (line 122) | def add(selfNode, nodeData): method remove (line 129) | def remove(selfNode, nodeData): method search (line 137) | def search(selfNode, nodeData): FILE: Data-Structures/Tree/Binary-Search-Tree/Binary_Search_Tree_operations.cpp type dll (line 24) | struct dll function dll (line 31) | dll *BSTinsert(dll *root,int x) //Inserting node in BST function levelorder (line 64) | void levelorder(dll *root) //Print the node in levelorder form function Rpreorder (line 91) | void Rpreorder(dll *root) //Recursive Postorder function NRpreorder (line 101) | void NRpreorder(dll *root) //Iterative Preorder function Rinorder (line 119) | void Rinorder(dll *root) //Recursive Inorder function NRinorder (line 129) | void NRinorder(dll *root) //Iterative Inorder function Rpostorder (line 146) | void Rpostorder(dll *root) //Recursive Postorder function NRpostorder (line 159) | void NRpostorder(dll *root) //Iterative Postorder function BSTheight (line 192) | int BSTheight(dll *root) //Height of BST function dll (line 217) | dll* f_min(dll *root) //Find Minimum element from root function dll (line 227) | dll *f_max(dll *root) //Find Maximum element from root function search (line 237) | bool search(dll *root,int x) //Search an element in BST function dll (line 260) | dll *bstdelete(dll *root, int x) //Delete the node from BST function dll (line 304) | dll *mirr(dll *root) //Mirror image of the BST function dll (line 324) | dll *nd_copy(dll *root) function par_chld (line 337) | void par_chld(dll *root) //Print all parents and their Children function leaf_nd (line 379) | void leaf_nd(dll *root) //Print all leafnode in BST function main (line 397) | int main() //main function FILE: Data-Structures/Tree/Binary-Search-Tree/LCA.py class new_node (line 4) | class new_node: method __init__ (line 5) | def __init__(self,data): function insert (line 10) | def insert(root,data): function inorder (line 24) | def inorder(root): function find_LCA (line 30) | def find_LCA(root,n1,n2): FILE: Data-Structures/Tree/Binary-Search-Tree/Validate_BST.py class BSTNode (line 3) | class BSTNode: method __init__ (line 4) | def __init__(self, data): # Node Structure method isValid (line 10) | def isValid(self): FILE: Data-Structures/Tree/Binary-Search-Tree/Vertcal_order_traversal.py class new_node (line 3) | class new_node: method __init__ (line 4) | def __init__(self,data): function insert (line 9) | def insert(root,data): function vertical_line (line 22) | def vertical_line(root,hd,m): function print_vertical_order (line 33) | def print_vertical_order(root): function inorder (line 42) | def inorder(root): FILE: Data-Structures/Tree/Binary-Search-Tree/inorder_transversal.c type node (line 3) | struct node type node (line 10) | struct node type node (line 12) | struct node type node (line 12) | struct node type node (line 13) | struct node function printInorder (line 19) | void printInorder(struct node* node) function main (line 32) | int main() FILE: Data-Structures/Tree/Binary-Search-Tree/operationBST.cpp type Node (line 4) | struct Node function Node (line 10) | Node* FindMin(Node *node) function Node (line 21) | Node* FindMax(Node *node) function Node (line 32) | Node *Insert(Node *node,int info) function Node (line 52) | Node * Delet(Node *node, int info) function Node (line 87) | Node * Find(Node *node, int info) function Inorder (line 106) | void Inorder(Node *node) function Preorder (line 116) | void Preorder(Node *node) function Postorder (line 126) | void Postorder(Node *node) function CountNodes (line 139) | int CountNodes(Node*root) function main (line 158) | main() FILE: Data-Structures/Tree/Binary-Search-Tree/postorder_transversal.c type node (line 3) | struct node type node (line 10) | struct node type node (line 12) | struct node type node (line 12) | struct node type node (line 13) | struct node function printPostorder (line 19) | void printPostorder(struct node* node) function main (line 31) | int main() FILE: Data-Structures/Tree/Binary-Tree/BTree.cpp type BTreeNode (line 7) | struct BTreeNode function BTreeNode (line 23) | BTreeNode * newNode(){ function traverseBTree (line 36) | void traverseBTree(BTreeNode* node){ function splitChild (line 50) | int splitChild(BTreeNode *node, int index){ function insertNode (line 95) | void insertNode(int val){ class Deletion (line 146) | class Deletion{ method getPredecessor (line 150) | int getPredecessor(BTreeNode* node, int i){ method getSuccessor (line 159) | int getSuccessor(BTreeNode* node, int i){ method borrowFromPrevious (line 168) | void borrowFromPrevious(BTreeNode* node, int i){ method borrowFromNext (line 187) | void borrowFromNext(BTreeNode* node, int i){ method merge (line 204) | void merge(BTreeNode* node, int i){ method findClosestKey (line 223) | int findClosestKey(BTreeNode* node, int key){ method removeFromLeaf (line 231) | void removeFromLeaf(BTreeNode* node, int i){ method removeFromGeneral (line 239) | void removeFromGeneral(BTreeNode* node, int i){ method fill (line 256) | void fill(BTreeNode* node, int i){ method removeFromSubtree (line 270) | void removeFromSubtree(BTreeNode* node, int key){ method deleteNode (line 293) | void deleteNode(BTreeNode* root, int val){ function BTreeNode (line 311) | BTreeNode* search(BTreeNode* root, int val){ function main (line 322) | int main(){ FILE: Data-Structures/Tree/Binary-Tree/Binary tree using C.c type bin_tree (line 4) | struct bin_tree { type node (line 8) | typedef struct bin_tree node; function insert (line 10) | void insert(node ** tree, int val) function print_preorder (line 33) | void print_preorder(node * tree) function print_inorder (line 44) | void print_inorder(node * tree) function print_postorder (line 54) | void print_postorder(node * tree) function deltree (line 64) | void deltree(node * tree) function node (line 74) | node* search(node ** tree, int val) function main (line 95) | void main() FILE: Data-Structures/Tree/Binary-Tree/Btree.java class Btree (line 20) | class Btree { method Btree (line 25) | Btree(int t) { method traverse (line 31) | public void traverse() { method search (line 38) | public BTreeNode search(int k) { class BTreeNode (line 47) | class BTreeNode { method BTreeNode (line 55) | BTreeNode(int t, boolean leaf) { method traverse (line 64) | public void traverse() { method search (line 85) | BTreeNode search(int k) { // returns NULL if k is not present. FILE: Data-Structures/Tree/Binary-Tree/Check_duplicates_in _BTree.java class CheckDuplicateValues (line 2) | public class CheckDuplicateValues { method checkDupUtil (line 4) | public static boolean checkDupUtil(Node root, HashSet s) method checkDup (line 15) | public static boolean checkDup(Node root) method main (line 21) | public static void main(String args[]) { class Node (line 33) | class Node { method Node (line 37) | Node(int data) FILE: Data-Structures/Tree/Binary-Tree/Density/DensityBtree.c type Node (line 6) | struct Node { //Struct for a Node in the tree type Node (line 11) | struct Node type Node (line 12) | struct Node type Node (line 12) | struct Node function heightAndSize (line 18) | int heightAndSize(struct Node* node, int *size) { function density (line 29) | float density(struct Node* root){ //Function to calculate density by pa... function main (line 39) | int main(){ FILE: Data-Structures/Tree/Binary-Tree/Density/DensityBtree.cpp type Node (line 5) | struct Node function Node (line 11) | Node* newNode(int data) function heighAndSize (line 19) | int heighAndSize(Node* node, int &size) function density (line 31) | float density(Node* root) function main (line 43) | int main() FILE: Data-Structures/Tree/Binary-Tree/Deserialize/Deserialize.rb class TreeNode (line 4) | class TreeNode method initialize (line 7) | def initialize(value = nil) class Codec (line 14) | class Codec method initialize (line 15) | def initialize(empty_leaf_marker, separator) method serialize (line 21) | def serialize(root) method deserialize (line 30) | def deserialize(data) method build_tree (line 39) | def build_tree(data) FILE: Data-Structures/Tree/Binary-Tree/Duplicate_values.cs class CheckDuplicateValues (line 5) | class CheckDuplicateValues method checkDupUtil (line 10) | public static Boolean checkDupUtil(Node root, HashSet s) method checkDup (line 30) | public static Boolean checkDup(Node root) method Main (line 36) | public static void Main(String []args) class Node (line 48) | public class Node method Node (line 52) | public Node(int data) FILE: Data-Structures/Tree/Binary-Tree/Invert_Binary_Tree/Invert_Binary_Tree.py function invertBinaryTree (line 8) | def invertBinaryTree(tree): function swap (line 19) | def swap(tree): class BinaryTree (line 23) | class BinaryTree: method __init__ (line 24) | def __init__(self, value): method __init__ (line 47) | def __init__(self, value): function invertBinaryTree (line 33) | def invertBinaryTree(tree): function swap (line 41) | def swap(tree): class BinaryTree (line 46) | class BinaryTree: method __init__ (line 24) | def __init__(self, value): method __init__ (line 47) | def __init__(self, value): FILE: Data-Structures/Tree/Binary-Tree/Invert_Binary_Tree/invertBinTree.rb class BST (line 2) | class BST class Node (line 5) | class Node method initialize (line 10) | def initialize(val) method initialize (line 16) | def initialize(val) method insert (line 21) | def self.insert(val, tree) method invert (line 35) | def self.invert(tree) method printTree (line 49) | def self.printTree(tree, level = 0) FILE: Data-Structures/Tree/Binary-Tree/Invert_Binary_Tree/invert_binary_tree.cpp type TreeNode (line 4) | struct TreeNode { type TreeNode (line 10) | struct TreeNode type TreeNode (line 11) | struct TreeNode type TreeNode (line 11) | struct TreeNode type TreeNode (line 11) | struct TreeNode function invert (line 18) | void invert(TreeNode* A){ function TreeNode (line 27) | TreeNode* invertTree(TreeNode* root) { function main (line 31) | int main() { FILE: Data-Structures/Tree/Binary-Tree/Right_View/RightViewBTree.java class Node (line 1) | class Node { method Node (line 6) | Node(int item) { class Max_level (line 13) | class Max_level { class BinaryTree (line 18) | class BinaryTree { method rightViewUtil (line 24) | void rightViewUtil(Node node, int level, Max_level max_level) { method rightView (line 40) | void rightView() method rightView (line 45) | void rightView(Node node) { method main (line 50) | public static void main(String args[]) { FILE: Data-Structures/Tree/Binary-Tree/Right_View/rightViewBinTree.rb class BST (line 2) | class BST class Node (line 5) | class Node method initialize (line 10) | def initialize(val) method initialize (line 16) | def initialize(val) method insert (line 21) | def self.insert(val, tree) method rightSideView (line 35) | def self.rightSideView(tree) method printTree (line 45) | def self.printTree(tree, level = 0) FILE: Data-Structures/Tree/Binary-Tree/Right_View/right_view.py class Node (line 1) | class Node: method __init__ (line 3) | def __init__(self, item): function rightViewUtil (line 9) | def rightViewUtil(root, level, max_level): function rightView (line 22) | def rightView(root): FILE: Data-Structures/Tree/Binary-Tree/Right_View/right_view_of_binary_tree.cpp type TreeNode (line 4) | struct TreeNode { function TreeNode (line 10) | TreeNode* newNode(int val) { function getRightView (line 17) | vector getRightView(TreeNode* root) { function main (line 42) | int main() { FILE: Data-Structures/Tree/Binary-Tree/Serialize/Serialize.cpp type Node (line 4) | struct Node type Node (line 7) | struct Node function Node (line 10) | Node* newNode(int key) type Node (line 7) | struct Node function serialize (line 18) | void serialize(Node *root, FILE *fp) function main (line 31) | int main() FILE: Data-Structures/Tree/Binary-Tree/Serialize/Serialize.py class Node (line 1) | class Node: method __init__ (line 2) | def __init__(self, key, left=None, right=None): method __repr__ (line 7) | def __repr__(self): function serialize (line 13) | def serialize(root): FILE: Data-Structures/Tree/Binary-Tree/Subtree_check/Subtree_check.cpp type Node (line 8) | struct Node { type Node (line 10) | struct Node function Node (line 14) | Node* newNode(char item) type Node (line 10) | struct Node function storeInorder (line 24) | void storeInorder(Node* root, char arr[], int& i) function storePreOrder (line 37) | void storePreOrder(Node* root, char arr[], int& i) function isSubtree (line 49) | bool isSubtree(Node* T, Node* S) function main (line 83) | int main() FILE: Data-Structures/Tree/Binary-Tree/SymmetricBTree.java class Node (line 1) | class Node method Node (line 6) | Node(int item) class BinaryTree (line 13) | class BinaryTree method isMirror (line 17) | boolean isMirror(Node node1, Node node2) method isSymmetric (line 27) | boolean isSymmetric(Node node) method main (line 33) | public static void main(String args[]) FILE: Data-Structures/Tree/Binary-Tree/SymmetryBTree.cs class Node (line 5) | class Node method Node (line 10) | public Node(int item) class GFG (line 17) | class GFG method isMirror (line 23) | Boolean isMirror(Node node1, method isSymmetric (line 51) | Boolean isSymmetric(Node node) method Main (line 58) | static public void Main(String[] args) FILE: Data-Structures/Tree/Binary-Tree/SymmetryBTree.py class TreeNode (line 2) | class TreeNode: method __init__ (line 4) | def __init__(self, val=0, left=None, right=None): function isMirror (line 16) | def isMirror(root1, root2): function isSymmetric (line 43) | def isSymmetric(root: TreeNode): FILE: Data-Structures/Tree/Binary-Tree/SymmetryBTree/SymmetryBTree.rb class TreeNode (line 8) | class TreeNode method initialize (line 11) | def initialize(val = 0, left = nil, right = nil) function symmetric? (line 19) | def symmetric?(root) function check_symmetry (line 24) | def check_symmetry(actual, mirror) FILE: Data-Structures/Tree/Binary-Tree/Two_level_Node.java class Node (line 6) | class Node method Node (line 11) | public Node(int item) class BinaryTree (line 18) | class BinaryTree method printLevels (line 24) | void printLevels(Node node, int low, int high) method main (line 79) | public static void main(String args[]) FILE: Data-Structures/Tree/Binary-Tree/Two_level_Node/two_level_Node.cpp type Node (line 5) | struct Node type Node (line 8) | struct Node function printLevels (line 13) | void printLevels(Node* root, int low, int high) function Node (line 64) | Node* newNode(int key) type Node (line 8) | struct Node function main (line 73) | int main() FILE: Data-Structures/Tree/Binary-Tree/VerticalOrderTraversal.java class Solution (line 17) | class Solution { method verticalTraversal (line 18) | public List> verticalTraversal(TreeNode root) { method view (line 34) | public void view(TreeNode root, int x, int y, TreeMap &s) { function isDup (line 30) | bool isDup(struct TreeNode* root) { function main (line 35) | int main() { FILE: Data-Structures/Tree/Binary-Tree/duplicate_values.py class newNode (line 2) | class newNode: method __init__ (line 5) | def __init__(self, key): function checkDupUtil (line 10) | def checkDupUtil( root, s) : function checkDup (line 30) | def checkDup( root) : FILE: Data-Structures/Tree/Binary-Tree/duplicate_values.rb class BST (line 2) | class BST class Node (line 5) | class Node method initialize (line 10) | def initialize(val) method initialize (line 16) | def initialize(val) method insert (line 21) | def self.insert(val, tree) method duplicates? (line 35) | def self.duplicates?(tree, prev_vals = []) method printTree (line 50) | def self.printTree(tree, level = 0) FILE: Data-Structures/Tree/Binary-Tree/subtree_check.cpp class node (line 5) | class node function node (line 14) | node* newNode(int data) function areIdentical (line 30) | bool areIdentical(node * root1, node *root2) function isSubtree (line 59) | bool isSubtree(node *T, node *S) function main (line 77) | int main() FILE: Data-Structures/Tree/Binary-Tree/symmetry_bTree.cpp type TreeNode (line 2) | struct TreeNode { function TreeNode (line 9) | TreeNode *newNode(int val) { function check (line 16) | int check(TreeNode* A, TreeNode* B){ function isSymmetric (line 31) | int isSymmetric(TreeNode* A) { function main (line 38) | int main() { FILE: Data-Structures/Tree/Binary-Tree/two_level_node.py class Node (line 1) | class Node: method __init__ (line 3) | def __init__(self, key): function printLevels (line 10) | def printLevels(root, low, high): FILE: Data-Structures/Tree/Expression Tree/Expression_Tree.cpp type dll (line 11) | struct dll function levelorder (line 18) | void levelorder(dll *root) function Rpreorder (line 45) | void Rpreorder(dll *root) //Recursive preorder function NRpreorder (line 55) | void NRpreorder(dll *root) //non-Recursive preorder function Rinorder (line 73) | void Rinorder(dll *root) //Recursive inorder function NRinorder (line 83) | void NRinorder(dll *root) //non-Recursive inorder function Rpostorder (line 100) | void Rpostorder(dll *root) //Recursive postorder function NRpostorder (line 113) | void NRpostorder(dll *root) //non-Recursive postorder function isOperator (line 146) | bool isOperator(char c) //checking whether operator function trav (line 155) | void trav(dll *root) //tree traversal function call1 (line 187) | void call1(char s[]) //postfix expression function call2 (line 228) | void call2(char s[]) //prefix expression function main (line 267) | int main() FILE: Data-Structures/Tree/Fibonacci-Heap/Fibonacci-Heap.c type NODE (line 8) | typedef struct _NODE { type FIB_HEAP (line 19) | typedef struct fibanocci_heap { function FIB_HEAP (line 37) | FIB_HEAP *make_fib_heap() { function print_heap (line 48) | void print_heap(NODE *n) { function insertion (line 64) | void insertion(FIB_HEAP *H, NODE *new, int val) { function NODE (line 89) | NODE *find_min_node(FIB_HEAP *H) { function FIB_HEAP (line 98) | FIB_HEAP *unionHeap(FIB_HEAP *H1, FIB_HEAP *H2) { function cal_degree (line 119) | int cal_degree(int n) { function consolidate (line 129) | void consolidate(FIB_HEAP *H) { function fib_heap_link (line 185) | void fib_heap_link(FIB_HEAP *H, NODE *y, NODE *x) { function NODE (line 210) | NODE *extract_min(FIB_HEAP *H) { function cut (line 249) | void cut(FIB_HEAP *H, NODE *node_to_be_decrease, NODE *parent_node) { function cascading_cut (line 272) | void cascading_cut(FIB_HEAP *H, NODE *parent_node) { function decrease_key (line 285) | void decrease_key(FIB_HEAP *H, NODE *node_to_be_decrease, int new_key) { function FIB_HEAP (line 333) | FIB_HEAP *insertion_procedure() { function Delete_Node (line 351) | void Delete_Node(FIB_HEAP *H, int dec_key) { function main (line 361) | int main(int argc, char **argv) { FILE: Data-Structures/Tree/Generic Tree/GenericTree.cpp type Node (line 7) | struct Node method Node (line 11) | Node(int x) function main (line 17) | int main() FILE: Data-Structures/Tree/Red-Black-Tree/Red-Black-Tree.c type nodeColor (line 4) | enum nodeColor { type rbNode (line 9) | struct rbNode { type rbNode (line 14) | struct rbNode type rbNode (line 17) | struct rbNode type rbNode (line 18) | struct rbNode type rbNode (line 19) | struct rbNode type rbNode (line 19) | struct rbNode function insertion (line 27) | void insertion(int data) { function deletion (line 112) | void deletion(int data) { function inorderTraversal (line 307) | void inorderTraversal(struct rbNode *node) { function main (line 317) | int main() { FILE: Data-Structures/Tree/Red-Black-Tree/Red-Black-Tree.cpp type Node (line 4) | struct Node { class RedBlackTree (line 14) | class RedBlackTree { method initializeNULLNode (line 19) | void initializeNULLNode(NodePtr node, NodePtr parent) { method preOrderHelper (line 28) | void preOrderHelper(NodePtr node) { method inOrderHelper (line 37) | void inOrderHelper(NodePtr node) { method postOrderHelper (line 46) | void postOrderHelper(NodePtr node) { method NodePtr (line 54) | NodePtr searchTreeHelper(NodePtr node, int key) { method deleteFix (line 66) | void deleteFix(NodePtr x) { method rbTransplant (line 126) | void rbTransplant(NodePtr u, NodePtr v) { method deleteNodeHelper (line 137) | void deleteNodeHelper(NodePtr node, int key) { method insertFix (line 189) | void insertFix(NodePtr k) { method printHelper (line 233) | void printHelper(NodePtr root, string indent, bool last) { method RedBlackTree (line 252) | RedBlackTree() { method preorder (line 260) | void preorder() { method inorder (line 264) | void inorder() { method postorder (line 268) | void postorder() { method NodePtr (line 272) | NodePtr searchTree(int k) { method NodePtr (line 276) | NodePtr minimum(NodePtr node) { method NodePtr (line 283) | NodePtr maximum(NodePtr node) { method NodePtr (line 290) | NodePtr successor(NodePtr x) { method NodePtr (line 303) | NodePtr predecessor(NodePtr x) { method leftRotate (line 317) | void leftRotate(NodePtr x) { method rightRotate (line 335) | void rightRotate(NodePtr x) { method insert (line 354) | void insert(int key) { method NodePtr (line 395) | NodePtr getRoot() { method deleteNode (line 399) | void deleteNode(int data) { method printTree (line 403) | void printTree() { function main (line 410) | int main() { FILE: Data-Structures/Tree/Red-Black-Tree/Red-Black-Tree.java class Node (line 2) | class Node { class RedBlackTree (line 10) | public class RedBlackTree { method preOrderHelper (line 15) | private void preOrderHelper(Node node) { method inOrderHelper (line 24) | private void inOrderHelper(Node node) { method postOrderHelper (line 33) | private void postOrderHelper(Node node) { method searchTreeHelper (line 42) | private Node searchTreeHelper(Node node, int key) { method fixDelete (line 54) | private void fixDelete(Node x) { method rbTransplant (line 114) | private void rbTransplant(Node u, Node v) { method deleteNodeHelper (line 125) | private void deleteNodeHelper(Node node, int key) { method fixInsert (line 176) | private void fixInsert(Node k) { method printHelper (line 220) | private void printHelper(Node root, String indent, boolean last) { method RedBlackTree (line 238) | public RedBlackTree() { method preorder (line 246) | public void preorder() { method inorder (line 250) | public void inorder() { method postorder (line 254) | public void postorder() { method searchTree (line 258) | public Node searchTree(int k) { method minimum (line 262) | public Node minimum(Node node) { method maximum (line 269) | public Node maximum(Node node) { method successor (line 276) | public Node successor(Node x) { method predecessor (line 289) | public Node predecessor(Node x) { method leftRotate (line 303) | public void leftRotate(Node x) { method rightRotate (line 321) | public void rightRotate(Node x) { method insert (line 339) | public void insert(int key) { method getRoot (line 380) | public Node getRoot() { method deleteNode (line 384) | public void deleteNode(int data) { method printTree (line 388) | public void printTree() { method main (line 392) | public static void main(String[] args) { FILE: Data-Structures/Tree/Red-Black-Tree/Red-Black-Tree.py class Node (line 5) | class Node(): method __init__ (line 6) | def __init__(self, item): class RedBlackTree (line 14) | class RedBlackTree(): method __init__ (line 15) | def __init__(self): method pre_order_helper (line 23) | def pre_order_helper(self, node): method in_order_helper (line 30) | def in_order_helper(self, node): method post_order_helper (line 37) | def post_order_helper(self, node): method search_tree_helper (line 44) | def search_tree_helper(self, node, key): method delete_fix (line 53) | def delete_fix(self, x): method __rb_transplant (line 103) | def __rb_transplant(self, u, v): method delete_node_helper (line 113) | def delete_node_helper(self, node, key): method fix_insert (line 155) | def fix_insert(self, k): method __print_helper (line 191) | def __print_helper(self, node, indent, last): method preorder (line 206) | def preorder(self): method inorder (line 209) | def inorder(self): method postorder (line 212) | def postorder(self): method searchTree (line 215) | def searchTree(self, k): method minimum (line 218) | def minimum(self, node): method maximum (line 223) | def maximum(self, node): method successor (line 228) | def successor(self, x): method predecessor (line 238) | def predecessor(self, x): method left_rotate (line 249) | def left_rotate(self, x): method right_rotate (line 265) | def right_rotate(self, x): method insert (line 281) | def insert(self, key): method get_root (line 316) | def get_root(self): method delete_node (line 319) | def delete_node(self, item): method print_tree (line 322) | def print_tree(self): FILE: Data-Structures/Tree/Segment-Tree/Segment-Tree.c function main (line 26) | int main(int argc, char const *argv[]){ function build (line 65) | int build(int *listV, int *listSegment, int startInterv, int endInterv, ... function update (line 76) | int update(int newValue, int indexUpdate, int *listSegment, int startInt... function getSum (line 88) | int getSum(int *listSegment, int findStartIndex, int findEndIndex, int s... function show (line 101) | void show(char *title, int *l, int length){ FILE: Data-Structures/Tree/Splay-Tree/Splay-Tree.c type s (line 5) | struct s//node declaration function class (line 11) | class SplayTree function main (line 166) | int main() FILE: Data-Structures/Tree/Threaded Binary Tree/Threaded_Binary_Tree.cpp type TBT_nd (line 14) | struct TBT_nd function TBT_nd (line 23) | TBT_nd *insert(TBT_nd *root, TBT_nd *temp) //Inserting node in Threaded ... function TBT_nd (line 66) | TBT_nd *new_nd() function TBT_nd (line 78) | TBT_nd *create(TBT_nd *root) //Create the node in Threaded Binary Tree function TBT_nd (line 106) | TBT_nd *pre_suc(TBT_nd *t) //Predecessor of the node function TBTpreoder (line 116) | void TBTpreoder(TBT_nd *root) //Preoder Traversal in Threaded BT function TBT_nd (line 126) | TBT_nd *in_suc(TBT_nd *t) //Successor of the node function TBTinoder (line 136) | void TBTinoder(TBT_nd *root) //Inoder Traversal in Threaded BT function main (line 150) | int main() //Main function FILE: Data-Structures/Tree/Trie/Trie.c type TrieNode (line 13) | struct TrieNode type TrieNode (line 20) | struct TrieNode type TrieNode (line 22) | struct TrieNode type TrieNode (line 24) | struct TrieNode type TrieNode (line 24) | struct TrieNode function insert (line 39) | void insert(struct TrieNode *root, const char *key) function search (line 61) | bool search(struct TrieNode *root, const char *key) function main (line 81) | int main() FILE: Data-Structures/Tree/Trie/trie.cpp type TrieNode (line 4) | struct TrieNode function TrieNode (line 11) | TrieNode* createNode(void) function insert (line 20) | void insert(TrieNode*& node, const string &str, int index = 0) function string (line 50) | string search(TrieNode* root, const string &str, int index = 0) function main (line 71) | int main() FILE: Data-Structures/Tree/Trie/trie.py class TrieNode (line 1) | class TrieNode: method __init__ (line 3) | def __init__(self): class Trie (line 8) | class Trie: method __init__ (line 9) | def __init__(self): method getNode (line 12) | def getNode(self): method _charToIndex (line 17) | def _charToIndex(self,ch): method insert (line 22) | def insert(self,key): method search (line 36) | def search(self, key): function main (line 48) | def main(): FILE: Maths/Algebra/Babylionian/Babylionian.cs class SQRT (line 6) | class SQRT { method squareRoot (line 10) | static float squareRoot(float n) method Main (line 30) | public static void Main() FILE: Maths/Algebra/Babylionian/Babylionian.go function main (line 8) | func main() { FILE: Maths/Algebra/Babylionian/Babylonian.java class Babylonian (line 1) | class Babylonian { method squareRoot (line 5) | static float squareRoot(float n) { method main (line 24) | public static void main(String[] args) { FILE: Maths/Algebra/Babylonian/Babylonian.js function babylonianSqrt (line 1) | function babylonianSqrt(n) { FILE: Maths/Algebra/Babylonian/babylonian_square_root.c function squareRoot (line 12) | float squareRoot( int num ){ function main (line 23) | int main(){ FILE: Maths/Algebra/Derivative_Of_Polynomial/Matrix_Multiplication.c function main (line 3) | int main() FILE: Maths/Algebra/Factorial/Factorial.java class Factorial (line 3) | public class Factorial { method factorial (line 4) | static int factorial(int n) { method main (line 12) | public static void main(String[] args) { FILE: Maths/Algebra/Factorial/factorial.c function factorial (line 3) | unsigned int factorial(unsigned int n) function main (line 11) | int main() FILE: Maths/Algebra/Factorial/factorial.cpp function main (line 6) | int main() function factorial (line 18) | int factorial(int n) FILE: Maths/Algebra/Factorial/factorial.cs class FactorialExample (line 2) | public class FactorialExample method Main (line 4) | public static void Main(string[] args) FILE: Maths/Algebra/Factorial/factorial.go function IterativeFactorial (line 7) | func IterativeFactorial(number int) uint64 { function main (line 19) | func main() { FILE: Maths/Algebra/Factorial/factorial.php function fact (line 12) | function fact ($n) FILE: Maths/Algebra/Factorial/factorial.py function fact (line 2) | def fact(num): FILE: Maths/Algebra/Factorial_of_Large_Number/Factorial_of_Large_Number.cs class Factorial_of_Large_Number (line 4) | public class Factorial_of_Large_Number method Main (line 8) | public static void Main(string[] args) method FindFactorial (line 25) | static void FindFactorial(int n) method DigitWiseMultiply (line 37) | static void DigitWiseMultiply(int factor) method DisplayDigits (line 56) | static void DisplayDigits() FILE: Maths/Algebra/Factorial_of_Large_Number/Factorial_of_Large_Number.php function factorial (line 11) | function factorial(int $number) { function calcFactorialInDigit (line 31) | function calcFactorialInDigit(int $number) { FILE: Maths/Algebra/Factorial_of_Large_Number/Factorial_of_large_number.c function factorial (line 3) | unsigned int factorial(unsigned int n) function main (line 11) | int main() FILE: Maths/Algebra/Factorial_of_Large_Number/bigfactorial.cpp function factorial (line 5) | void factorial(int n) function multiply (line 17) | int multiply(int x, int res[], int res_size) function main (line 34) | int main() { FILE: Maths/Algebra/Factorial_of_Large_Number/largeFactorial.java class Main (line 3) | public class Main method facorial (line 5) | static BigInteger facorial(BigInteger n) method main (line 11) | public static void main(String[] args) FILE: Maths/Algebra/GCD/Euclidean_gcd.py function euclideanGCD (line 1) | def euclideanGCD(x, y): FILE: Maths/Algebra/GCD/EuclidianGCD.py function gcd (line 1) | def gcd(a, b): FILE: Maths/Algebra/GCD/GCD.cpp function gcd (line 7) | int gcd(int a, int b) function main (line 18) | int main() FILE: Maths/Algebra/GCD/GCD.cs class Program (line 2) | public class Program method GCD (line 4) | static int GCD(int num1, int num2) method Main (line 18) | static int Main(string[] args) FILE: Maths/Algebra/GCD/GCD.js function gcd_two_numbers (line 1) | function gcd_two_numbers(x, y) { FILE: Maths/Algebra/GCD/GCD.php function gcd (line 12) | function gcd($a, $b) function gcd_array (line 29) | function gcd_array($array, $a = 0) FILE: Maths/Algebra/GCD/GCD.py function euclid_gcd (line 2) | def euclid_gcd(a, b): FILE: Maths/Algebra/GCD/GCD.rb function gcd (line 3) | def gcd(num1, num2) FILE: Maths/Algebra/GCD/gcd.java class GCD (line 2) | public class GCD method main (line 4) | public static void main(String args[]) method findGCD (line 22) | private static int findGCD(int number1, int number2) FILE: Maths/Algebra/LCM/LCM.c function main (line 2) | int main() { FILE: Maths/Algebra/LCM/LCM.cpp type algo_ds (line 2) | namespace algo_ds function gcd (line 19) | [[nodiscard]] constexpr std::common_type_t gcd(const T& a, const... function lcm (line 29) | [[nodiscard]] constexpr std::common_type_t lcm(const T& a, const... function main (line 55) | int main() FILE: Maths/Algebra/LCM/LCM.java class Test (line 2) | class Test method gcd (line 5) | static int gcd(int a, int b) method lcm (line 13) | static int lcm(int a, int b) method main (line 19) | public static void main(String[] args) FILE: Maths/Algebra/LCM/LCM.py function lcm (line 1) | def lcm(x:int, y:int) -> int: function main (line 17) | def main(): FILE: Maths/Algebra/LCM/LCM_GCD.c function main (line 2) | int main() FILE: Maths/Algebra/LCM/LCM_python.py function compute_gcd (line 1) | def compute_gcd(x, y): function compute_lcm (line 8) | def compute_lcm(x, y): FILE: Maths/Algebra/Markov_Matrix/MarkovMatrix.java class MarkovMatrix (line 3) | public class MarkovMatrix{ method main (line 5) | public static void main(String []args){ FILE: Maths/Algebra/Markov_Matrix/Markov_Matrix.cs class MarkovMatrix (line 16) | public static class MarkovMatrix { method Validate (line 17) | public static MatrixType Validate(decimal[,] matrix) method ContainsInvalidElements (line 43) | private static bool ContainsInvalidElements(decimal[,] matrix) method IsLeftStochastic (line 48) | private static bool IsLeftStochastic(decimal[,] matrix) method IsRightStochastic (line 62) | private static bool IsRightStochastic(decimal[,] matrix) method GetRow (line 76) | private static IEnumerable GetRow(decimal[,] matrix, int rowI... method GetColumn (line 87) | private static IEnumerable GetColumn(decimal[,] matrix, int c... type MatrixType (line 99) | public enum MatrixType FILE: Maths/Algebra/Markov_Matrix/Markov_Matrix.js function isMarkovMatrix (line 1) | function isMarkovMatrix(matrix) { function isRightMarkov (line 15) | function isRightMarkov(matrix) { //Each row summing to 1 function isLeftMarkov (line 29) | function isLeftMarkov(matrix) { //Each collumn summing to 1 FILE: Maths/Algebra/Matrix_Multipication/MatMul.cpp class Matrix (line 8) | class Matrix { method Matrix (line 12) | Matrix(std::vector> dataArray) { method Matrix (line 16) | Matrix(size_t row, size_t col) { method T (line 21) | T& operator[](std::array index) { method rowCount (line 27) | size_t rowCount() { method columnCount (line 31) | size_t columnCount() { method toString (line 35) | std::string toString() { function main (line 65) | int main() { FILE: Maths/Algebra/Matrix_Multipication/MatrixMultipication.py function matrixMultiplication (line 1) | def matrixMultiplication(matrixA, matrixB): FILE: Maths/Algebra/Matrix_Multipication/MatrixMultiply.java class MatrixMultiply (line 3) | public class MatrixMultiply { method main (line 7) | public static void main(String[] args) { FILE: Maths/Algebra/Matrix_Multipication/Matrix_Multiplication.js function multiply (line 1) | function multiply(a, b) { function display (line 22) | function display(m) { FILE: Maths/Algebra/Matrix_Multipication/multiply.c function main (line 5) | int main(){ FILE: Maths/Algebra/Matrix_Multipication/multiply.cpp function main (line 3) | int main() FILE: Maths/Algebra/Matrix_Multipication/multiply.java class MatrixMultiplicationExample (line 1) | public class MatrixMultiplicationExample{ method main (line 2) | public static void main(String args[]){ FILE: Maths/Algebra/Matrix_Multipication/multiply.php function multiply (line 2) | function multiply(&$mat1, &$mat2, &$res) FILE: Maths/Algebra/Permutation_And_Combination/permutation_combination.cpp function factorial (line 4) | long long factorial( long long num ){ function permutation (line 16) | long long permutation( long long n , long long r ){ function combination (line 20) | long long combination( long long n , long long r ){ function main (line 24) | int main(){ FILE: Maths/Algebra/Permutation_And_Combination/permutation_combination.js function permutation (line 39) | function permutation(N , R){ function permutation (line 42) | function permutation(N , R){ function combination (line 45) | function combination(N, R){ function Factorial (line 49) | function Factorial(N){ function promoptForInput (line 54) | function promoptForInput(){ FILE: Maths/Algebra/Prime_Factorization/PrimeFactorisation.cpp function PrimeFactorisation (line 7) | void PrimeFactorisation(int num) function main (line 32) | int main() FILE: Maths/Algebra/Prime_Factorization/Prime_Factor.c function main (line 5) | int main() FILE: Maths/Algebra/Prime_Factorization/Prime_Factorisation.cpp function primeFactors (line 4) | void primeFactors(int n) function main (line 27) | int main() FILE: Maths/Algebra/Prime_Factorization/Prime_Factorization.cs class Math (line 13) | class Math method IsPrimeNumber (line 21) | static bool IsPrimeNumber(int num) method GetPrimeFactors (line 51) | static public int GetPrimeFactors(int num, out int [] arrResult) method Main (line 123) | static void Main(string[] args) FILE: Maths/Algebra/Prime_Factorization/prime.cpp function PF (line 6) | void PF(int n) function main (line 34) | int main() FILE: Maths/Algebra/Prime_Factorization/prime_factorization.cpp function fac (line 3) | long fac(long i) function main (line 12) | int main() FILE: Maths/Algebra/Prime_Factorization/prime_factorization.java class prime_factorization (line 25) | class prime_factorization{ method factorize (line 28) | private static void factorize(int n){ method main (line 58) | public static void main(String[] args){ FILE: Maths/Algebra/Prime_Factorization/prime_factorization.py function primeFactors (line 5) | def primeFactors(n): FILE: Maths/Algebra/Quadratic_Formula/Quadratic_Formula.cpp function main (line 5) | int main() { FILE: Maths/Algebra/Sieve of Eratosthenes/SieveOfEratosthenes.cpp function Sieve (line 8) | void Sieve(int n) function main (line 32) | int main() FILE: Maths/Algebra/Sieve of Eratosthenes/SieveOfEratosthenes.py function Sieve (line 3) | def Sieve(n): FILE: Maths/Algebra/Sieve of Eratosthenes/SieveOfEratosthens.c function SieveOfEratosthenes (line 6) | void SieveOfEratosthenes(int num) function main (line 37) | int main() FILE: Maths/Algebra/Sieve of Eratosthenes/SieveofEratosthenes.java class SieveofEratosthenes (line 11) | public class SieveofEratosthenes { method main (line 12) | public static void main (String[] args) method getPrimes (line 30) | public boolean[] getPrimes(int limit) { method printPrimes (line 52) | public void printPrimes(boolean[] isPrime) { FILE: Maths/Algebra/Strassens_Algorithm/Strassen.java class Strassen (line 2) | class Strassen method multiply (line 4) | public int[][] multiply(int[][] A, int[][] B) method sub (line 70) | public int[][] sub(int[][] A, int[][] B) method add (line 79) | public int[][] add(int[][] A, int[][] B) method split (line 88) | public void split(int[][] P, int[][] C, int iB, int jB) method join (line 95) | public void join(int[][] C, int[][] P, int iB, int jB) method main (line 102) | public static void main (String[] args) FILE: Maths/Algebra/Strassens_Algorithm/strassens.py function split (line 3) | def split(matrix): function strassen (line 8) | def strassen(x, y): FILE: Maths/Calculus/Euler_Approximation/Euler_Approximation.c function fun (line 4) | float fun(float x, float y) function main (line 11) | int main() FILE: Maths/Calculus/Euler_Approximation/Euler_Approximation.cpp function func (line 9) | float func(float x, float y) function euler (line 15) | void euler(float x0, float y, float h, float x) function main (line 33) | int main() FILE: Maths/Calculus/Euler_Approximation/Euler_Approximation.java class Euler_Approximation (line 2) | public class Euler_Approximation { method function (line 9) | public static double function(double x, double y) { method approximate (line 23) | public static double approximate(final double xInitial, final double y... method main (line 43) | public static void main(String[] args) { FILE: Maths/Calculus/Euler_Approximation/Euler_Approximation.py function func (line 7) | def func( x, y ): function euler (line 10) | def euler( x0, y, h, x ): FILE: Maths/Calculus/Leibniz_formula/LeibnizFormula.py function leibniz_formula (line 9) | def leibniz_formula(u, v, n: int): FILE: Maths/Calculus/Leibniz_formula/Leibniz_Formula.java class Leibniz_formula (line 1) | public class Leibniz_formula { method main (line 2) | public static void main(String[] args) { FILE: Maths/Calculus/Leibniz_formula/Leibniz_formula.cpp function main (line 4) | int main() FILE: Maths/Calculus/Riemann_Sum/Riemann.py function Rsum (line 3) | def Rsum(a,b): FILE: Maths/Calculus/Riemann_Sum/Riemann_Sum.cpp function F1 (line 4) | double F1(double x,double a){ function main (line 10) | int main(){ FILE: Maths/Calculus/Riemann_Sum/Riemann_Sum.cs type IFunction (line 3) | internal interface IFunction method CalculateFx (line 5) | float CalculateFx(float x); class XPowerN (line 8) | internal class XPowerN : IFunction method XPowerN (line 12) | public XPowerN(float n) method CalculateFx (line 17) | public float CalculateFx(float x) method ToString (line 22) | public override string ToString() class AsinNX (line 28) | internal class AsinNX : IFunction method AsinNX (line 33) | public AsinNX(float a, float n) method CalculateFx (line 39) | public float CalculateFx(float x) method ToString (line 44) | public override string ToString() class AcosNX (line 50) | internal class AcosNX : IFunction method AcosNX (line 55) | public AcosNX(float a, float n) method CalculateFx (line 61) | public float CalculateFx(float x) method ToString (line 66) | public override string ToString() class AtanNX (line 72) | internal class AtanNX : IFunction method AtanNX (line 77) | public AtanNX(float a, float n) method CalculateFx (line 83) | public float CalculateFx(float x) method ToString (line 88) | public override string ToString() class Riemann_Sum (line 94) | public class Riemann_Sum method Main (line 96) | public static void Main(string[] args) method EvaluateRiemannSumLeft (line 158) | private static void EvaluateRiemannSumLeft( method EvaluateRiemannSumRight (line 176) | private static void EvaluateRiemannSumRight( method EvaluateRiemannSumTrapezoid (line 193) | private static void EvaluateRiemannSumTrapezoid( FILE: Maths/Calculus/Riemann_Sum/riemann_sum.py function riemann_sum (line 4) | def riemann_sum(f, a, b, N: int, method='midpoint'): FILE: Maths/Calculus/Runge–Kutta_Method/Range-Kutta.c function compare_float (line 2) | int compare_float(float x, float y) function equation (line 10) | float equation(float x,float y) function next (line 16) | float next(float x,float y,float h) function main (line 27) | int main() FILE: Maths/Calculus/Runge–Kutta_Method/Runge-Kutta.cpp function dx_dt (line 13) | static double dx_dt(double t, double x) function calculate_Y (line 25) | void calculate_Y(double &initial_X, double final_X,double interval ,doub... function main (line 44) | int main(int argc, const char * argv[]) FILE: Maths/Calculus/Runge–Kutta_Method/Runge-Kutta.py function dydx (line 4) | def dydx(x, y): FILE: Maths/Discrete/Ackermann_Peter/Ackermann_Peter.c function ackermann_peter (line 2) | int ackermann_peter(int m, int n) function main (line 15) | int main(){ FILE: Maths/Discrete/Ackermann_Peter/Ackermann_Peter.cpp function main (line 4) | int main() function A (line 16) | int A(int m,int n) FILE: Maths/Discrete/Ackermann_Peter/Ackermann_Peter.js function ackermann_peter (line 1) | function ackermann_peter(m, n){ FILE: Maths/Discrete/Ackermann_Peter/Ackermann_Peter.py function ackermann_peter_10 (line 1) | def ackermann_peter_10(m, n): FILE: Maths/Discrete/Ackermann_Peter/Python/ackermann.py function ackermann (line 1) | def ackermann(m,n): FILE: Maths/Geometry/Clock_Angle/ClockAngle.cs class ClockAngle (line 5) | class ClockAngle method Main (line 7) | static void Main(string[] args) method findAngleBetweenHourAndMinuteHand (line 17) | private static double findAngleBetweenHourAndMinuteHand(int hours, int... FILE: Maths/Geometry/Clock_Angle/Clock_Angle.c function main (line 3) | int main(){ FILE: Maths/Geometry/Clock_Angle/Clock_Angle.cpp function findAngle (line 5) | int findAngle(int hour, int min) function main (line 15) | int main() FILE: Maths/Geometry/Clock_Angle/Clock_Angle.java class Clock_Angle (line 1) | public class Clock_Angle { method findAngle (line 2) | public static int findAngle(int hour, int minute){ method main (line 24) | public static void main(String[] args){ FILE: Maths/Geometry/Clock_Angle/clock_angle.go constant minutesPerHour (line 9) | minutesPerHour = 60 constant hourHandDegreePerMinute (line 10) | hourHandDegreePerMinute = 0.5 constant minuteHandDegreePerMinute (line 11) | minuteHandDegreePerMinute = 6 function clockAngle (line 17) | func clockAngle(hours uint, minutes uint) (float64, error) { function main (line 31) | func main() { FILE: Maths/Geometry/Clock_Angle/clock_angle.py function clock_angle (line 12) | def clock_angle(hour, minute): FILE: Maths/Geometry/Distance_Formula/Distance_Formula.c function main (line 4) | int main() FILE: Maths/Geometry/Distance_Formula/Distance_Formula.cpp function main (line 5) | int main() { FILE: Maths/Geometry/Distance_Formula/Distance_Formula.cs type Point (line 3) | internal struct Point method Point (line 8) | public Point(float x, float y) method ToString (line 14) | public override string ToString() class Distance_Formula (line 20) | public class Distance_Formula method Main (line 22) | public static void Main(string[] args) FILE: Maths/Geometry/Distance_Formula/Distance_Formula.go function main (line 7) | func main() { FILE: Maths/Geometry/Distance_Formula/Distance_Formula.java class Distance_Formula (line 1) | public class Distance_Formula { method findDistance (line 2) | public static double findDistance(double x1, double y1 , double x2, do... FILE: Maths/Geometry/Distance_Formula/Distance_Formula.php function distance (line 11) | function distance($x1,$x2,$y1,$y2){ FILE: Maths/Geometry/Distance_Formula/Distance_Formula.py function Distance_Formula (line 8) | def Distance_Formula(x, y): FILE: Maths/Geometry/Manhattan_Distance/ManhattanDistance.java class ManhattanDistance (line 4) | public class ManhattanDistance method main (line 7) | public static void main(String[] args) { FILE: Maths/Geometry/Manhattan_Distance/Manhattan_Distance.c function manhattan_dist (line 7) | int manhattan_dist(int a1 , int a2 , int b1 , int b2) { function main (line 11) | int main() { FILE: Maths/Geometry/Manhattan_Distance/manhattan_dist.cpp function main (line 6) | int main() function manhattan_dist (line 18) | int manhattan_dist(int a1, int a2, int b1, int b2) FILE: Maths/Geometry/Manhattan_Distance/manhattan_dist.go function calcManhattanDist (line 8) | func calcManhattanDist(x1, y1, x2, y2 int) { function main (line 13) | func main() { FILE: Maths/Geometry/Manhattan_Distance/manhattan_dist.py function calcManhattanDist (line 1) | def calcManhattanDist(x1, y1, x2, y2) -> float: function main (line 4) | def main(): FILE: Maths/Geometry/Manhattan_Distance/manhattan_distance.py function manhattan_dist (line 2) | def manhattan_dist(x1, y1, x2, y2): FILE: Maths/Geometry/N_Dimensional_Distance/N_Dimensional_Distance.c function n_dimensional_distance (line 13) | float n_dimensional_distance(double const *point1, double const * point2... function main (line 26) | int main(void) FILE: Maths/Geometry/Polar_Cartesian_Conversion/Polar_Cartesian_Conversion.go function convert_to_cartesian (line 15) | func convert_to_cartesian(r float64, theta float64){ function main (line 30) | func main() { FILE: Maths/Geometry/Polar_Cartesian_Conversion/Polar_Cartesian_Conversion.java class PolarCartesian (line 3) | public class PolarCartesian { method main (line 5) | public static void main(String[] args) { FILE: Maths/Geometry/Polar_Cartesian_Conversion/Polar_Cartesian_Conversion.py function polarToCart (line 3) | def polarToCart(r, theta): FILE: Maths/Geometry/Pythagorean_theorem/PythagoreanTheorem.cs class PythagoreanTheorem (line 6) | class PythagoreanTheorem method GetHypotenuse (line 12) | private static double GetHypotenuse(float a, float b) method GetSideA (line 18) | private static double GetSideA(float b, float c) method GetSideB (line 24) | private static double GetSideB(float a, float c) method IsRightAngled (line 29) | private static bool IsRightAngled(float a, float b, float c) method Main (line 34) | static void Main(string[] args) FILE: Maths/Geometry/Pythagorean_theorem/Pythagorean_theorem.cpp function main (line 4) | int main() { FILE: Maths/Geometry/Pythagorean_theorem/Pythagorean_theorem.py function CheckPythagoreanTriplet (line 1) | def CheckPythagoreanTriplet(a, b, c): FILE: Maths/Geometry/Pythagorean_theorem/pythogoras_theorem.java class pythogoras_theorem (line 4) | class pythogoras_theorem{ method main (line 5) | public static void main(String args[]){ FILE: Maths/Geometry/Radians_Degrees_Conversion/Radians_Degree_Conversion.c function Convert (line 7) | double Convert(double degree) { function main (line 13) | int main() { FILE: Maths/Geometry/Radians_Degrees_Conversion/Radians_Degrees_Conversion.c function main (line 6) | int main() function convert (line 43) | float convert(float *n, int _case) FILE: Maths/Geometry/Radians_Degrees_Conversion/Radians_Degrees_Conversion.cpp function Convert (line 6) | double Convert(double degree) function main (line 13) | int main() FILE: Maths/Geometry/Radians_Degrees_Conversion/Radians_Degrees_Conversion.java class Conversion (line 1) | class Conversion { method radiansToDegrees (line 2) | private static double radiansToDegrees(double radians) { method degreesToRadians (line 6) | private static double degreesToRadians(double degrees) { method round (line 10) | private static double round(double value) { method main (line 14) | public static void main(String[] args) { FILE: Maths/Geometry/Radians_Degrees_Conversion/Radians_Degrees_Conversion.py function convert (line 1) | def convert(degree): FILE: Maths/Geometry/Scalar_Product/Scalar_Product.c function main (line 5) | int main() { FILE: Maths/Geometry/Scalar_Product/Scalar_Product.java class ScalarProduct (line 3) | class ScalarProduct { method dotProduct (line 6) | static int dotProduct(int vect_A[], int vect_B[]) { method main (line 13) | public static void main(String[] args) { FILE: Maths/Geometry/Scalar_Product/Scalar_Product.js function scalarProduct (line 7) | function scalarProduct(vectorA, vectorB) { FILE: Maths/Geometry/Scalar_Product/Scalar_Product.py function Scalar_Product (line 9) | def Scalar_Product(x, y): function float_input (line 12) | def float_input(string_input): FILE: Maths/Geometry/Scalar_Product/scalar_product.cpp function main (line 6) | int main() function scalar_prod (line 25) | void scalar_prod(int x[], int y[], int num) FILE: Maths/Geometry/Scalar_Product/scalar_product.rb function scalar_product (line 3) | def scalar_product(vector_a, vector_b) FILE: Maths/Geometry/Vector_Product/Vector_Product.c function main (line 5) | int main() { FILE: Maths/Geometry/Vector_Product/Vector_Product.cpp function vector_product (line 4) | vector vector_product (vector a, vector b){ function main (line 16) | int main(){ FILE: Maths/Geometry/Vector_Product/Vector_Product.js function crossProduct (line 7) | function crossProduct(vectorA, vectorB) { FILE: Maths/Geometry/Vector_Product/Vector_Product.py function Vector_Product (line 7) | def Vector_Product(a, b): function float_input (line 10) | def float_input(string_input): FILE: Maths/Geometry/Vector_Product/Vector_Product.ts type ThreeDimensionalVector (line 11) | type ThreeDimensionalVector = [number, number, number]; function crossProduct (line 19) | function crossProduct(vectorA: ThreeDimensionalVector, vectorB: ThreeDim... FILE: Maths/MOs-Algorithm/Mos_Algorithm.c type Query (line 6) | struct Query function printQuerySums (line 12) | void printQuerySums(int a[], int n, Query q[], int m) function main (line 31) | int main() FILE: Maths/MOs-Algorithm/Mos_Algorithm.cpp type Query (line 16) | struct Query { function compare (line 20) | bool compare(Query x, Query y) { function queryResults (line 27) | void queryResults(vector a, const int n, vector q, const int... function main (line 71) | int main() FILE: Maths/Number-Theory/Armstrong_Number/ArmstrongNumber.java class ArmstrongNum (line 6) | public class ArmstrongNum { method main (line 8) | public static void main(String[] args) { FILE: Maths/Number-Theory/Armstrong_Number/Armstrong_Number.c function main (line 5) | int main() FILE: Maths/Number-Theory/Armstrong_Number/armstrong.py function check_armstrong (line 1) | def check_armstrong(num): FILE: Maths/Number-Theory/Armstrong_Number/armstrongin.java class Armstrong (line 1) | public class Armstrong { method main (line 3) | public static void main(String[] args) { FILE: Maths/Number-Theory/Armstrong_Number/armstrongnumber.cpp function main (line 12) | int main() FILE: Maths/Number-Theory/Extended Euclidean Algorithm/extendEuclid.cpp function gcdExtended (line 7) | int gcdExtended(int a, int b, int *x, int *y) function main (line 29) | int main() FILE: Maths/Number-Theory/Extended Euclidean Algorithm/extendEuclid.py function gcdExtended (line 3) | def gcdExtended(a, b): FILE: Maths/Number-Theory/Fibonacci_Number/Fibonacci.cs class Fibonacci (line 4) | public static class Fibonacci { method GetValue (line 10) | public static int GetValue(int index) { FILE: Maths/Number-Theory/Fibonacci_Number/FibonacciNumbers.java class FibonacciNumbers (line 3) | public class FibonacciNumbers { method main (line 5) | public static void main(String[] args) { FILE: Maths/Number-Theory/Fibonacci_Number/Fibonacci_Number.cpp function main (line 4) | int main() FILE: Maths/Number-Theory/Fibonacci_Number/Fibonacci_Number.py function fibonacci (line 1) | def fibonacci(number): FILE: Maths/Number-Theory/Perfect_Number/Perfect Number.cpp function main (line 5) | int main(){ FILE: Maths/Number-Theory/Perfect_Number/Perfect_Number.java class Nothing (line 5) | public class Nothing { method main (line 6) | public static void main(String[] args) { method divisor (line 26) | int divisor(int x) { FILE: Maths/Number-Theory/Perfect_Number/perfec_numper.py function isPerfect (line 1) | def isPerfect( n ): FILE: Maths/Number-Theory/Perfect_Number/perfectnumber.cpp function main (line 5) | int main() FILE: Maths/Number-Theory/Perfect_Number/perfectnumber.js function is_perfect (line 1) | function is_perfect(number) { FILE: Maths/Number-Theory/Segmented_Sieve/Segmented_Sieve.php function segmentedSieve (line 4) | function segmentedSieve(int $maxValue): array FILE: Maths/Number-Theory/Segmented_Sieve/segmented_sieve.js function segmented_sieve (line 1) | function segmented_sieve(n){ FILE: Maths/Number-Theory/Segmented_Sieve/segmented_sieve.py function segmented_sieve (line 1) | def segmented_sieve(n): FILE: Maths/Number-Theory/Sieve_of_Eratosthenes/SieveOfEratosthenes.c function SieveOfEratosthenes (line 6) | void SieveOfEratosthenes(int num) function main (line 37) | int main() FILE: Maths/Number-Theory/Sieve_of_Eratosthenes/SieveOfEratosthenes.cs class SieveOfEratosthenes (line 6) | class SieveOfEratosthenes method GetAllPrimesUpTo (line 9) | private static int[] GetAllPrimesUpTo(int num) // Includes num method Main (line 46) | static void Main(string[] args) FILE: Maths/Number-Theory/Sieve_of_Eratosthenes/Sieve_of_Erastosthenes.rb class SieveOfErastosthenes (line 1) | class SieveOfErastosthenes method initialize (line 2) | def initialize(limit) method call (line 8) | def self.call(limit) method call (line 12) | def call method initial_array (line 19) | def initial_array method find_primes (line 24) | def find_primes method find_multiples (line 33) | def find_multiples(index) FILE: Maths/Number-Theory/Sieve_of_Eratosthenes/Sieve_of_Eratosthenes.c function main (line 3) | int main() FILE: Maths/Number-Theory/Sieve_of_Eratosthenes/Sieve_of_Eratosthenes.cpp function SieveOfEratosthenes (line 6) | void SieveOfEratosthenes(int n) function main (line 35) | int main() FILE: Maths/Number-Theory/Sieve_of_Eratosthenes/Sieve_of_Eratosthenes.go function checkPrime (line 5) | func checkPrime(n int) bool { function generateSieve (line 22) | func generateSieve(n int) []int { function main (line 32) | func main() { FILE: Maths/Number-Theory/Sieve_of_Eratosthenes/SieveofErastosthenes.java class PrimeSieve (line 1) | public class PrimeSieve { method main (line 2) | public static void main(String[] args) { FILE: Maths/Number-Theory/Smith_number/SmithNumber.py function factors (line 8) | def factors(n): function getIntLetterCount (line 23) | def getIntLetterCount(n): function isSmithNumber (line 26) | def isSmithNumber(n): FILE: Maths/Number-Theory/Smith_number/smith_numbers_till_n.cpp function sieve_of_sundaram (line 15) | void sieve_of_sundaram() function is_smith_number (line 37) | bool is_smith_number(int n) function main (line 81) | int main() FILE: Maths/Number-Theory/Strong_Number/strong_number.c function main (line 2) | int main() function fact (line 27) | int fact(int r) FILE: Maths/Number-Theory/Strong_Number/strong_number.cpp function main (line 4) | int main() FILE: Maths/Number-Theory/Strong_Number/strong_number.java class Main (line 2) | public class Main method main (line 4) | public static void main(String[] args) { FILE: Maths/Number-Theory/Ugly_Number/UglyNumber.go function isUgly (line 14) | func isUgly(num int) bool { function main (line 29) | func main() { FILE: Maths/Number-Theory/Ugly_Number/Ugly_Number.c function main (line 4) | int main() FILE: Maths/Number-Theory/Ugly_Number/Ugly_Number.java class Solution (line 4) | class Solution{ method isUgly (line 6) | public boolean isUgly(int number) { class Ugly_Number (line 27) | public class Ugly_Number method main (line 29) | public static void main(String[] args){ FILE: Maths/Number-Theory/Ugly_Number/Ugly_Number.php function checkUglyNumber (line 23) | function checkUglyNumber($number) { FILE: Maths/Number-Theory/Ugly_Number/Ugly_Number.py function is_ugly_number (line 5) | def is_ugly_number(num): FILE: Maths/Number-Theory/Ugly_Number/Ugly_Number.rb class UglyNumber (line 1) | class UglyNumber method is_ugly? (line 4) | def self.is_ugly?(number) FILE: Maths/Number-Theory/Ugly_Number/Ugly_Number_Till_N.cpp function getNthUglyNo (line 5) | unsigned getNthUglyNo(unsigned n) function main (line 40) | int main() FILE: Maths/Series/Arithmetic_Progression/AP.py function AP (line 1) | def AP(a,d,n): FILE: Maths/Series/Arithmetic_Progression/Arithematic_Progression.cpp function main (line 3) | int main() FILE: Maths/Series/Arithmetic_Progression/Arithmetic_Progression.c function main (line 3) | void main(){ FILE: Maths/Series/Arithmetic_Progression/Arithmetic_Progression.java class Arithmetic_Progression (line 4) | public class Arithmetic_Progression { method main (line 5) | public static void main(String[] args) { FILE: Maths/Series/Arithmetic_Progression/Arithmetic_Progression.js function arithmeticProgression (line 18) | function arithmeticProgression(firstTerm, difference, nTerms) { function arithmeticProgressionNthTerm (line 36) | function arithmeticProgressionNthTerm(nTerm, firstTerm, difference) { function arithmeticSeries (line 51) | function arithmeticSeries(firstTerm, lastTerm, nTerms) { FILE: Maths/Series/Arithmetic_Progression/Arithmetic_Progression.ts class ArithmeticProgression (line 7) | class ArithmeticProgression { method constructor (line 16) | constructor(firstTerm: number = 0, difference: number = 1) { method calculate (line 30) | calculate(nTerms: number): number[] { method getNthTerm (line 47) | getNthTerm(nTerm: number): number { method getSeries (line 61) | getSeries(lastTerm: number, nTerms: number): number { method getDifference (line 75) | getDifference(secondTerm: number, abs: boolean): number { FILE: Maths/Series/Fibonacci/Fibonacci.c function main (line 6) | int main() { FILE: Maths/Series/Fibonacci/Fibonacci.cpp function fib (line 5) | int fib(int n) function main (line 29) | int main(){ FILE: Maths/Series/Fibonacci/Fiboncci.py function fibonacci (line 1) | def fibonacci(number): FILE: Maths/Series/Fibonacci/fibonacci.cpp function fib (line 5) | int fib(int n) function main (line 29) | int main(){ FILE: Maths/Series/Fibonacci/fibonacci.java class Fibonacci (line 1) | public class Fibonacci { method main (line 3) | public static void main(String[] args) { FILE: Maths/Series/Geometric_Progression/Geometric Progression.py function gp (line 1) | def gp(a,r,n): FILE: Maths/Series/Geometric_Progression/GeometricProgression.cs class GeometricProgression (line 2) | class GeometricProgression { method gp (line 4) | static int gp(int a, int q, int n){ method Main (line 8) | static void Main() { FILE: Maths/Series/Geometric_Progression/GeometricProgression.java class Main (line 2) | public class Main method GP (line 5) | static void GP(int a, int r, int n){ method validGP (line 13) | static boolean validGP(int[] ar,int n){ method nthGP (line 27) | static void nthGP(int a, int r, int n){ method sum (line 32) | static void sum(int a, int r, int n){ FILE: Maths/Series/Harmonic_Progression/Harmonic Progression.cpp function main (line 3) | int main() FILE: Maths/Series/Harmonic_Progression/HarmonicProgresion.c function main (line 4) | int main() { FILE: Maths/Series/Harmonic_Progression/Harmonic_Expression.java class Harmonic_Expression (line 3) | public class Harmonic_Expression{ method main (line 4) | public static void main(String args[]){ FILE: Maths/Series/Harmonic_Progression/harmonic_progression.py function HP (line 1) | def HP(a,d,n): FILE: Maths/Series/Lucas_Series/Lucas_Series.c function main (line 3) | int main() FILE: Maths/Series/Lucas_Series/Lucas_Series.cpp function main (line 4) | int main() { FILE: Maths/Series/Lucas_Series/Lucas_Series.go function printLucasSeries (line 11) | func printLucasSeries(size int) { function main (line 23) | func main() { FILE: Maths/Series/Lucas_Series/Lucas_Series.php function Lucas_Number (line 2) | function Lucas_Number($n){ FILE: Maths/Series/Lucas_Series/lucas_series.cs class Program (line 3) | class Program method Main (line 5) | static void Main(string[] args) FILE: Maths/Series/Lucas_Series/lucas_series.py function LucasSum (line 1) | def LucasSum(N): FILE: Maths/Series/Modular_Exponentiation/Modular_Exponentiation.cpp function main (line 6) | int main(){ FILE: Maths/Series/Modular_Exponentiation/Modular_Exponentiation.py function modularExp (line 27) | def modularExp(a, b, m): FILE: Maths/Series/Modular_Exponentiation/modular_exponentiation.c function main (line 4) | int main(){ FILE: Maths/Series/Modular_Exponentiation/modular_exponentiation.cpp function main (line 6) | int main(){ FILE: Maths/Series/Modular_Exponentiation/modular_exponentiation.java class modular_exponentiation (line 3) | public class modular_exponentiation{ method main (line 4) | public static void main(String[] args) { FILE: Maths/Series/Relative_Primes/RelativePrimes.c function main (line 3) | void main(){ FILE: Maths/Series/Relative_Primes/RelativePrimes.java class relativelyPrime (line 2) | public class relativelyPrime { method gcd (line 4) | static int gcd(int a, int b) method relativelyPrime (line 11) | private static boolean relativelyPrime(int a, int b) { method main (line 16) | public static void main(String[] args) { FILE: Maths/Series/Relative_Primes/RelativePrimes.php function gcd (line 4) | function gcd($int1, $int2) { function isRelativelyPrime (line 12) | function isRelativelyPrime($int1, $int2) { FILE: Maths/Series/Relative_Primes/RelativePrimes.py function gcd (line 1) | def gcd(num1, num2): function is_relative_prime (line 8) | def is_relative_prime(num1, num2): FILE: Maths/Series/Relative_Primes/Relative_Prime.cpp function main (line 5) | int main() FILE: Maths/Series/Relative_Primes/Relative_Primes.go function main (line 8) | func main() { FILE: Maths/Series/Sum_of_AP/Sum_Of_AP.CPP function is_ap (line 6) | int is_ap(int ap[],int terms,int common_difference[]) function evensum_ap (line 31) | int evensum_ap(int ap[], int terms, int common_difference[]) function oddsum_ap (line 40) | int oddsum_ap(int ap[], int terms, int common_difference[]) function main (line 51) | void main() FILE: Maths/Series/Sum_of_AP/Sum_Of_AP.py function Sum_AP (line 2) | def Sum_AP(ap): FILE: Maths/Series/Sum_of_AP/Sum_of_AP.c function AP (line 4) | float AP( float a, float d, int n){ function main (line 8) | int main(){ FILE: Maths/Series/Sum_of_AP/Sum_of_AP.go function sum_of_AP (line 15) | func sum_of_AP(a float64, d float64, n float64) float64{ function main (line 20) | func main() { FILE: Maths/Series/Sum_of_AP/Sum_of_AP_JAVA/Sum_of_AP.java class SumOfAP (line 5) | class SumOfAP{ method sumOfAP (line 8) | static float sumOfAP(float a, float d, method main (line 21) | public static void main(String args[]) FILE: Maths/Series/Sum_of_GP/Sum_Of_GP.c function power (line 35) | double power(double base,double exponent) function main (line 47) | int main() FILE: Maths/Series/Sum_of_GP/Sum_Of_GP.cpp function main (line 4) | int main() FILE: Maths/Series/Sum_of_GP/Sum_of_GP.java class Sum_of_GP (line 3) | public class Sum_of_GP { method sumGP (line 5) | static double sumGP(double firstTerm, double commonRatio, int numberOf... method sumGPToInfinity (line 9) | static double sumGPToInfinity(double firstTerm, double commonRatio) { method main (line 13) | public static void main(String[] args) { FILE: Maths/Series/Sum_of_GP/Sum_of_GP.py function sumOfGP (line 9) | def sumOfGP(a,r,n): FILE: Maths/Series/Sum_of_HP/HP_sum.py function HP (line 1) | def HP(a,d,n): FILE: Maths/Series/Sum_of_HP/Sum_of_HP.cpp function findSeriesSum (line 14) | float findSeriesSum(int a, int d, int n){ function main (line 23) | int main(){ FILE: Maths/Series/Sum_of_HP/Sum_of_HP.cs class Program (line 18) | class Program method Main (line 20) | static void Main() FILE: Maths/Series/Sum_of_N/Sum_of_n.c function main (line 8) | int main() { FILE: Maths/Series/Sum_of_N/sum_of_n_natural_no.cpp function main (line 6) | int main() FILE: Maths/Series/Sum_of_N/sum_of_n_natural_numbers.go function sumNNaturalNumbers (line 14) | func sumNNaturalNumbers(terms uint) uint { function main (line 18) | func main() { FILE: Maths/Series/Sum_of_N/sumn.py function sumn (line 2) | def sumn(n): FILE: Maths/Series/Sum_of_N/sumofNnaturalnums.cs class Exercise3 (line 2) | public class Exercise3 method Main (line 4) | public static void Main() FILE: Maths/Series/Sum_of_N2/Sum_Of_n^2.py function squaresum (line 5) | def squaresum(n) : FILE: Maths/Series/Sum_of_N2/square_sum.cs class GFG (line 3) | class GFG method squaresum (line 5) | public static int squaresum(int n) method Main (line 12) | public static void Main() FILE: Maths/Series/Sum_of_N2/sumofnsqaure.php function sum (line 3) | function sum($n) FILE: Maths/Series/Sum_of_N3/Sum of n3.cpp function main (line 7) | int main() { FILE: Maths/Series/Sum_of_N3/sum of n^3.cpp function sumOfSeries (line 10) | int sumOfSeries(int n) function main (line 21) | int main() FILE: Maths/Series/Sum_of_N3/sumofncube.php function sumOfSeries (line 3) | function sumOfSeries( $n) FILE: Maths/Statistics/Compound_Interest/Compound_Interest.c function main (line 4) | int main(){ FILE: Maths/Statistics/Compound_Interest/Compound_Interest.cpp function compoundInterest (line 5) | double compoundInterest(double p, double r, double t) { function main (line 9) | int main() { FILE: Maths/Statistics/Compound_Interest/Compound_Interest.cs class Program (line 3) | class Program method CalculateCompoundInterest (line 8) | private static double CalculateCompoundInterest(double initialAmount, ... method Main (line 16) | static void Main() method ExitAfterInvalidInput (line 52) | private static void ExitAfterInvalidInput() FILE: Maths/Statistics/Compound_Interest/Compound_Interest.java class Solution (line 5) | class Solution method compound_interest (line 8) | double compound_interest(double principle,double rate,double time){ class Compound_Interest (line 12) | public class Compound_Interest method main (line 15) | public static void main(String[] args) FILE: Maths/Statistics/Compound_Interest/Compound_Interest.py function compound_interest (line 4) | def compound_interest(principle, rate, time): FILE: Maths/Statistics/Compound_Interest/Compound_Interest.rb function calculateCompoundInterest (line 3) | def calculateCompoundInterest(principle, rate, time) FILE: Maths/Statistics/Confidence_Interval/Confidence_Interval.cpp function normalQuantile (line 9) | double normalQuantile(const double p) function confidence_interval (line 84) | std::array confidence_interval(const double estimator, const ... function main (line 110) | int main() FILE: Maths/Statistics/Confidence_Interval/Confidence_Inverval.c function normalQuantile (line 9) | double normalQuantile(const double p) function confidence_interval (line 84) | void confidence_interval(const double estimator, const double standardEr... function main (line 107) | int main(void) FILE: Maths/Statistics/Confidence_Interval/confidenceInterval.js function percentile_z (line 20) | function percentile_z(p) { FILE: Maths/Statistics/Exponential_Smoothing/Exponential_Smoothing.cpp class es_vec (line 25) | class es_vec method es_vec (line 29) | es_vec() method es_vec (line 35) | es_vec(const T _v) method es_vec (line 41) | es_vec(const es_vec & _vec) method reset (line 54) | void reset(const T _v = 0) method init (line 60) | void init(const T* _data) method T (line 66) | T & operator [] (const size_t _i) method T (line 71) | const T & operator [] (const size_t _i) const method T (line 112) | T* raw_data() method T (line 118) | const T norm() const class single_exponential_smoothing (line 193) | class single_exponential_smoothing method single_exponential_smoothing (line 197) | single_exponential_smoothing() : ses_smoothing_const(0.5), ses_counter... method set_smoothing_constant (line 210) | void set_smoothing_constant(const T _val) method set_vacillation_tolerance (line 217) | void set_vacillation_tolerance(const T _val) method push_to_pop (line 223) | const es_vec push_to_pop(const es_vec _curr_raw_ob) method counter (line 247) | const size_t counter() const { return ses_counter; } method reset (line 250) | void reset() class double_exponential_smoothing (line 273) | class double_exponential_smoothing method double_exponential_smoothing (line 277) | double_exponential_smoothing() : method set_1st_smoothing_constant (line 296) | void set_1st_smoothing_constant(const T _val) method set_2nd_smoothing_constant (line 303) | void set_2nd_smoothing_constant(const T _val) method set_vacillation_tolerance (line 310) | void set_vacillation_tolerance(const T _val) method push_to_pop (line 316) | const es_vec push_to_pop(const es_vec _curr_raw_ob) method counter (line 358) | const size_t counter() const { return des_counter; } method reset (line 361) | void reset() FILE: Maths/Statistics/Exponential_Smoothing/Exponential_Smoothing.java class DoubleExponentialSmoothingForLinearSeries (line 3) | public class DoubleExponentialSmoothingForLinearSeries { method fit (line 15) | public static Model fit(double[] data, double alpha, double beta) { method calculateSSE (line 36) | private static double calculateSSE(double[] data, double[] smoothedDat... method validateParams (line 44) | private static void validateParams(double alpha, double beta) { method main (line 54) | public static void main(String[] args) { class Model (line 67) | static class Model { method Model (line 73) | public Model(double[] smoothedData, double[] trends, double[] levels... method forecast (line 86) | double[] forecast(int size) { method getSmoothedData (line 94) | public double[] getSmoothedData() { method getTrend (line 98) | public double[] getTrend() { method getLevel (line 102) | public double[] getLevel() { method getSSE (line 106) | public double getSSE() { FILE: Maths/Statistics/Exponential_Smoothing/Exponential_Smoothing.rb function forecast (line 33) | def forecast(y, alpha, beta, gamma, period, m) function initial_level (line 68) | def initial_level(y, period) function calculateInitialTrend (line 79) | def calculateInitialTrend(y, period) FILE: Maths/Statistics/K-means_Clustering/K-means_Clustering.py class Cluster (line 8) | class Cluster: method __init__ (line 10) | def __init__(self, center, name): method distance (line 15) | def distance(self, point): method relocate (line 18) | def relocate(self): class KMeansCustom (line 23) | class KMeansCustom: method __init__ (line 25) | def __init__(self, n_clusters=5, max_iters=20, n_init=10): method fit (line 30) | def fit(self, X): method error (line 80) | def error(self, labels, clusters, X): FILE: Maths/Statistics/Mean/mean.cpp function mean (line 5) | int mean(int arr[], int n){ function main (line 14) | int main(){ FILE: Maths/Statistics/Mean/mean.java class mean (line 4) | public class mean { method main (line 6) | public static void main(String args[]){ FILE: Maths/Statistics/Mean/meanOfGivenNumbers.c function main (line 4) | int main() FILE: Maths/Statistics/Mean/meanOfGivenNumbers.cs class meanOfGivenNumbers (line 4) | class meanOfGivenNumbers method Main (line 6) | static void Main() FILE: Maths/Statistics/Median/Median.c function swap (line 3) | void swap(int *p,int *q) { function sort (line 11) | void sort(int a[],int n) { function main (line 22) | int main() { FILE: Maths/Statistics/Median/Median.java class Median (line 6) | public class Median { method main (line 8) | public static void main(String[] args) { method findMedian (line 31) | private static double findMedian(int[] arr, int n) { FILE: Maths/Statistics/Median/meadian.cpp function median (line 5) | float median(int b[],int n) function main (line 20) | int main() FILE: Maths/Statistics/Mode/Mode.java class Mode (line 3) | public class Mode { method main (line 7) | public static void main(String[] args) { FILE: Maths/Statistics/Mode/mode.c function mode (line 3) | int mode(int b[],int n) function main (line 23) | int main() FILE: Maths/Statistics/Mode/mode.cpp function main (line 9) | int main() function mode (line 26) | void mode(int arr[], int num) FILE: Maths/Statistics/Mode/mode.php function mode (line 3) | function mode($arr) { FILE: Maths/Statistics/Standard_Deviation/Standard_Deviation.c function main (line 6) | int main() { function calculateSD (line 18) | float calculateSD(float data[],int n) { FILE: Maths/Statistics/Standard_Deviation/Standard_Deviation.cpp function standardDeviation (line 5) | float standardDeviation(float data[]) function main (line 24) | int main() FILE: STL/Array/Array.cpp function main (line 5) | int main() FILE: STL/Map/MultiMap/multimap.cpp function main (line 7) | int main() FILE: STL/Map/Unodered-Map/unorderedmap.cpp function main (line 6) | int main() FILE: STL/Map/map.cpp function main (line 7) | int main() FILE: STL/Queue/Deque/deque.cpp function main (line 4) | int main(){ FILE: STL/Queue/PriorityQueue/priority_queue.cpp function main (line 3) | int main(int argc, char const *argv[]) { FILE: STL/Queue/Queue.cpp function print (line 8) | void print(queue q){ function main (line 15) | int main(int argc, char const *argv[]) { FILE: STL/Set/Unodered-Set/UnorderedSet.cpp function main (line 4) | int main() FILE: STL/Set/set.cpp function main (line 5) | int main() FILE: STL/Stack/stack.cpp function main (line 4) | int main(int argc, char const *argv[]) { FILE: STL/Vector/Vector.cpp function main (line 4) | int main() {