MCPcopy Create free account

hub / github.com/HarshCasper/NeoAlgo / functions

Functions5,549 in github.com/HarshCasper/NeoAlgo

⨍ Functions 5,549◇ Types & classes 1,056
↓ 3 callersFunctionMerge
Merge function helps us to calculate the inversion count.
C/sort/Count_Inversions.c:13
↓ 3 callersMethodaddLast
(int val)
Java/ds/foldALinkedList.java:29
↓ 3 callersFunctionaddZeroFront
(first, second string)
Go/math/karatsuba_multiplication/karatsuba_multiplication.go:60
↓ 3 callersFunctionarea
C-Plus-Plus/computational_geometry/Convex_Hull_Graham_Scan.cpp:29
↓ 3 callersMethodback
Returns the element at the back of the vector
C-Plus-Plus/ds/Vector.cpp:64
↓ 3 callersFunctionbalance_tree
this function balances our AVL tree(in case of deletion). we have the following cases covered below: (1)if critical node has balance factor>1 and the
C-Plus-Plus/ds/avl_tree.cpp:218
↓ 3 callersMethodbuildTree
(String str)
Java/other/Is_symmetric_tree.java:71
↓ 3 callersFunctioncheckInput
(input)
JavaScript/ML/NeuralNetwork.js:46
↓ 3 callersFunctioncheckRowValid
C-Plus-Plus/dp/townPlanning.cpp:40
↓ 3 callersMethodclear
()
JavaScript/ds/LinkedList.js:32
↓ 3 callersFunctioncontiguous_sub_array
* Function to print the index range of subarray equal to the given sum. If no such subarray found, print -1. * @param arr array to check * @param si
C-Plus-Plus/cp/SubArrayWithGivenSum.cpp:39
↓ 3 callersMethodcos
@return a new Complex object whose value is the complex cosine of this
Java/math/Complex.java:116
↓ 3 callersMethodcreate_linked_list
(self, arr)
Python/ds/linkedListIntersection.py:11
↓ 3 callersFunctioncreate_node
C/ds/singly_linked_list.c:92
↓ 3 callersMethoddeQueue
pop(): this will delete the value from the front of the Queue
Go/ds/stack/stack_using_queue/stack_using_queue.go:73
↓ 3 callersMethoddeleteItem
(value)
JavaScript/ds/Hash.js:75
↓ 3 callersFunctiondfs
C-Plus-Plus/graphs/Bridges.cpp:19
↓ 3 callersMethoddis
()
Java/Operating-System/allocate.java:363
↓ 3 callersFunctiondisplay
function to display linked list
C-Plus-Plus/ds/inversion_vector.cpp:90
↓ 3 callersFunctiondisplay
display function to print the linked lists
C-Plus-Plus/ds/alternate_merging_of_linked_list.cpp:94
↓ 3 callersFunctiondisplay
C-Plus-Plus/ds/Ascending_priority_queue.cpp:111
↓ 3 callersFunctiondisplay
C-Plus-Plus/ds/Descending_priority_queue.cpp:117
↓ 3 callersFunctiondisplay
C-Plus-Plus/ds/DoublyLinkedList.cpp:37
↓ 3 callersFunctiondisplay
C-Plus-Plus/ds/Priority_Queue_using_LinkedList.cpp:116
↓ 3 callersFunctiondisplay
to print the polynomial
C-Plus-Plus/math/polynomial_addition.cpp:36
↓ 3 callersFunctiondisplay
C/ds/Circular_LL.c:167
↓ 3 callersFunctiondisplay
to display the data in Priority Queue
C/ds/AscendingPQ.c:40
↓ 3 callersFunctiondisplay
C/ds/Priority_Queue_using_Linked_List.c:117
↓ 3 callersFunctiondisplay
to display the data in Priority Queue
C/ds/DescendingPQ.c:40
↓ 3 callersFunctiondisplay
to print the polynomial
C/math/polynomial_multiplication.c:36
↓ 3 callersFunctiondivisible
* This function repeatedly divides a give number till its divisible by the second number*/
Go/math/Ugly_Number/uglynumber.go:22
↓ 3 callersFunctionenQueue
enqueue the element at the rear end
C/ds/FindBinaryTreeBst.c:32
↓ 3 callersMethodenQueue
enQueue(): it first checks if there is space available for new element, if available it will just insert the value to end of the Queue
Go/ds/stack/stack_using_queue/stack_using_queue.go:60
↓ 3 callersFunctionencryption
Return the ciphertext by xor the message with a repeating key
Python/cryptography/XOR_cipher.py:4
↓ 3 callersFunctionenqueue
C/ds/QueueImplementationWithList.c:20
↓ 3 callersFunctionfact
fact function returns factorial of the number
C/math/Pascals_triangle.c:8
↓ 3 callersFunctionfft
standard Fast Fourier Transform Algorithm
C-Plus-Plus/cp/all_possible_sums_using_fft.cpp:51
↓ 3 callersFunctionfib
Recursion+Memoization
C-Plus-Plus/dp/fibonacci_top_down.cpp:5
↓ 3 callersFunctiongcd
C-Plus-Plus/math/GCD_In_C.cpp:10
↓ 3 callersMethodgetnbr
(self)
Python/graphs/Prims_Algo_dynamic.py:60
↓ 3 callersMethodinitQueue
()
Go/ds/stack/stack_using_queue/stack_using_queue.go:36
↓ 3 callersMethodinitialize
()
Java/dp/MemoryAllocations.java:49
↓ 3 callersMethodinorder
(Node root)
Java/ds/CheckBST.java:75
↓ 3 callersFunctioninsertAtBeginning
to insert into the linked list
C-Plus-Plus/math/polynomial_addition.cpp:25
↓ 3 callersFunctioninsertAtBeginning
to insert the terms of a polynomial
C/math/polynomial_multiplication.c:25
↓ 3 callersFunctioninsert_at_beg
C/ds/Circular_LL.c:23
↓ 3 callersMethodintersection
(int[] array1, int[] array2)
Java/cp/Intersection_of_Two_Arrays.java:20
↓ 3 callersFunctionisEmpty
C/ds/infixToPrefix.c:26
↓ 3 callersFunctionisEmpty
Checking if the Queue is empty or not*/
C/ds/queue_using_circular_array.c:28
↓ 3 callersFunctionisEmpty
Function to check if the stack is empty or not*/
C/ds/balanced_parenthesis.c:34
↓ 3 callersMethodisEmpty
()
JavaScript/ds/Queue.js:26
↓ 3 callersMethodisEmpty
Return boolean value. `True` if the priority queue is empty, esle, returns `False`.
Python/ds/priority_queue.py:40
↓ 3 callersMethodisEmpty
isEmpty(): this checks if stack is empty or not
Go/ds/stack/stack_using_queue/stack_using_queue.go:118
↓ 3 callersFunctionisFull
function to check if queue is at capacity
C-Plus-Plus/ds/priorityQ_array.cpp:28
↓ 3 callersFunctionisempty
C/cp/Stock_Span.c:11
↓ 3 callersMethodisempty
()
Java/ds/Stackll.java:17
↓ 3 callersMethodkthChild
(int i, int k)
Java/ds/heapmain.java:44
↓ 3 callersMethodleftRotate
(Node node)
Java/ds/AVL_Tree.java:134
↓ 3 callersFunctionlineread
()
JavaScript/Algorithms/kadane's_algo.js:22
↓ 3 callersFunctionmax
Function for finding maximum of two numbers */
C/other/Maximum_Product_Subarray.c:14
↓ 3 callersMethodmin_max_of_2_elements
(int x, int y)
Java/Algorithms/Min_Max_Algorithm_implementation.java:40
↓ 3 callersFunctionnewNode
function to create a new Tree Node
C-Plus-Plus/ds/Maximum_Width_BinaryTree.cpp:15
↓ 3 callersFunctionnewNode
Function to create a node with 'value' as the data stored in it. Both the children of this new Node are initially null.
C-Plus-Plus/ds/Sum_Of_Elements_Of_N_ary_Tree.cpp:27
↓ 3 callersFunctionnewNode
Function to create a node with 'value' as the data stored in it. Both the children of this new Node are initially null. */
C-Plus-Plus/ds/Balanced_BST_From_a_vector_of_values.cpp:23
↓ 3 callersFunctionnew_node
C-Plus-Plus/cp/count_leaves_in_binaryTree.cpp:15
↓ 3 callersFunctionnumSquareSum
(num)
Python/other/HappyNumber.py:1
↓ 3 callersFunctionoperator
(op)
JavaScript/ds/infixevaluator.js:79
↓ 3 callersMethodparent
(int i)
Java/ds/heapmain.java:40
↓ 3 callersFunctionpeek
C/ds/infixToPrefix.c:46
↓ 3 callersFunctionplay_move
(state, player, block_num)
Python/backtracking/Tic_Tac_Toe.py:24
↓ 3 callersFunctionpop
()
JavaScript/ds/prefixevaluator.js:61
↓ 3 callersFunctionpop
()
JavaScript/ds/postfixevaluator.js:57
↓ 3 callersFunctionpop
pop function pops an item from the top of the stack
C/ds/prefix-to-postfix.c:27
↓ 3 callersFunctionpop
Function to pop an element from stack.
C/ds/postfixToInfix.c:87
↓ 3 callersFunctionpop
pop function of stack
C/ds/postfix_to_prefix.c:45
↓ 3 callersMethodpop
()
JavaScript/ds/QueueStack.js:61
↓ 3 callersMethodpop
(self)
Python/other/Reverse_string_using_stack.py:7
↓ 3 callersMethodpop
pop(): this will remove the value from the top of the stack
Go/ds/queue/queue_using_stack/queue_using_stack.go:69
↓ 3 callersMethodpopStack
()
Go/dp/stack/stack.go:20
↓ 3 callersFunctionpowr
returns (a^b)%mod
C-Plus-Plus/other/Rabin_Karp_Algorithm_using_prefix_sum.cpp:17
↓ 3 callersFunctionpreorder
Function to perform pre-order traversal of the tree*/
C/ds/AVL_tree.c:26
↓ 3 callersFunctionpreorderIterative
C/ds/Preordertraversal.c:80
↓ 3 callersFunctionprime
C-Plus-Plus/ds/double-hashing.cpp:7
↓ 3 callersMethodprintItems
()
JavaScript/ds/QueueStack.js:137
↓ 3 callersFunctionprintKthLevel
Function to print the Kth level of the tree starting from a given node
C-Plus-Plus/ds/K_Distance_Nodes_Binary_Tree.cpp:71
↓ 3 callersMethodprintLL
(self)
Python/ds/Reverse_linked_list.py:22
↓ 3 callersMethodprintLinkedList
(ListNode head)
Java/ds/MergeInBetweenLinkedLists.java:74
↓ 3 callersFunctionprintLinkedlist
C-Plus-Plus/cp/Addition_of_2_numbers_representing_Linked_list.cpp:28
↓ 3 callersMethodprintList
()
JavaScript/ds/QueueLinkedList.js:83
↓ 3 callersFunctionprint_queue
C/ds/QueueImplementationWithList.c:68
↓ 3 callersMethodpriority
(char c)
Java/other/InfixToPostfix.java:31
↓ 3 callersFunctionpush
push operation for the stack
C-Plus-Plus/ds/iterative_preorder.cpp:25
↓ 3 callersFunctionpush
push operation for the stack
C/ds/Iterative_preorder.c:22
↓ 3 callersFunctionpush
push function for queue
C/operating_system/Round_Robin_Scheduling.c:33
↓ 3 callersFunctionpush
push function for queue
C/operating_system/priority_sjf.c:34
↓ 3 callersMethodpush
(element)
JavaScript/ds/Iterative_preorder.js:10
↓ 3 callersMethodpush
push(): this will push the value to the top of the stack
Go/ds/queue/queue_using_stack/queue_using_stack.go:58
↓ 3 callersMethodpush
(E a)
Java/ds/Stackll.java:18
↓ 3 callersFunctionreverse
function to reverse the string
C-Plus-Plus/cp/Reverse_string_using_stack.cpp:11
↓ 3 callersMethodreverse
(Node start)
Java/ds/ReversingCircularLinkedList.java:41
← previousnext →201–300 of 5,549, ranked by callers