MCPcopy Create free account

hub / github.com/SR-Sunny-Raj/Hacktoberfest2021-DSA / functions

Functions4,122 in github.com/SR-Sunny-Raj/Hacktoberfest2021-DSA

⨍ Functions 4,122◇ Types & classes 941↳ Endpoints 3
↓ 1 callersFunctionheapSort
main function to do heap sort
06. Sorting/heap sort.cpp:32
↓ 1 callersFunctionheapSort
main function to do heap sort
16. Heap/Heap_sort.cpp:29
↓ 1 callersMethodheapSort
(int heap[],int heapSize)
06. Sorting/HeapSort.java:24
↓ 1 callersFunctionheapdelete
06. Sorting/heapsort.c:54
↓ 1 callersFunctionheapinsert
06. Sorting/heapsort.c:29
↓ 1 callersFunctionheapsort
06. Sorting/heapsort.c:94
↓ 1 callersFunctionheight
Recursive function to calculate height of given binary tree
15. Binary Search Tree/Height _of_tree.cpp:17
↓ 1 callersMethodheight
(Node node)
14. Tree/Class4.java:72
↓ 1 callersMethodhelp
(int[][] graph, int i, boolean[] visited, Stack<Integer> st)
17. Graph/TopologicalSorting.java:22
↓ 1 callersFunctionhelper
04. Arrays/Count_inversions.cpp:29
↓ 1 callersFunctionhelper
10. Linked List/cpp/2.Insertion in Linked List.cpp:4
↓ 1 callersFunctioninOrder
14. Tree/check_BST.c:35
↓ 1 callersMethodinOrderTraversal
(TreeNode root, List<Integer>list)
14. Tree/Inorder_Traversal_Recursive.java:10
↓ 1 callersFunctioninfixToPostfix
11. Stack/infix_to_postfix.cpp:24
↓ 1 callersMethodinfixToPreFix
(String expression)
11. Stack/infix-to-prefix.java:17
↓ 1 callersFunctioninfixtopostfix
11. Stack/InfixtoPostfix.c:42
↓ 1 callersFunctioninfixtopostfix
11. Stack/Infix_to_Postfix_and_Evaluation.c:77
↓ 1 callersFunctioninit
30. CPP Programs/airline_restriction.cpp:17
↓ 1 callersFunctioninit
()
37. Projects/Javascript Puzzle Memory Game/script.js:88
↓ 1 callersFunctioninit
Initialise the array with 0's
17. Graph/adjacency_matrix.cpp.c:14
↓ 1 callersMethodinit
12. Queue/circularqueue.cpp:8
↓ 1 callersFunctioninit_div
Function to initialize DSU Initially, all vertices are their own parents
01. Mathematics/Boruvka’s Algorithm.cpp:62
↓ 1 callersFunctioninorder
14. Tree/Connect nodes at same level.cpp:29
↓ 1 callersFunctioninorder
14. Tree/serialize-deserialize-tree.cpp:38
↓ 1 callersFunctioninorder
15. Binary Search Tree/simple_BST.cpp:29
↓ 1 callersFunctioninorder
15. Binary Search Tree/BST_Traversals_MaxMin_Nodes.cpp:104
↓ 1 callersMethodinorder
(TreeNode root)
14. Tree/Recover-Binary-Tree.java:17
↓ 1 callersMethodinorder
14. Tree/count_node.cpp:77
↓ 1 callersMethodinorder
14. Tree/AVLtree.cpp:119
↓ 1 callersMethodinorderRec
(Node root)
06. Sorting/Treesort.java:63
↓ 1 callersFunctioninordersucc
15. Binary Search Tree/delete_in_BST.cpp:24
↓ 1 callersFunctioninput
Taking input in a linked list until user enters -1
10. Linked List/cpp/Insert_node_at_iTH_position.cpp:29
↓ 1 callersFunctioninsert
36. C Programs/Height of a Binary Tree.c:14
↓ 1 callersFunctioninsert
If not present, inserts key into trie If the key is prefix of trie node, just marks leaf node
21. Trie/InsertSearch.cpp:34
↓ 1 callersFunctioninsert
21. Trie/shortest_unique_prefix.cpp:34
↓ 1 callersFunctioninsert
04. Arrays/Menu-driven.cpp:13
↓ 1 callersFunctioninsert
10. Linked List/DeleteWithoutHeadPtr.cpp:25
↓ 1 callersFunctioninsert
10. Linked List/cpp/single_student_linkedlist.c:14
↓ 1 callersFunctioninsert
10. Linked List/cpp/Delete_Without_Head_Pointer.cpp:27
↓ 1 callersFunctioninsert
10. Linked List/c lang/DoublyLinkedList/doubly-linked-list.c:152
↓ 1 callersFunctioninsert
10. Linked List/c lang/SinglyLinkedList/Traversing.c:8
↓ 1 callersFunctioninsert
12. Queue/queue_implement.c:44
↓ 1 callersFunctioninsert
12. Queue/Circular Queue Implementation using Linked List.c:16
↓ 1 callersFunctioninsert
15. Binary Search Tree/BST_Traversals_MaxMin_Nodes.cpp:65
↓ 1 callersFunctioninsert
15. Binary Search Tree/isDeadEnd.cpp:19
↓ 1 callersFunctioninsert
simple code for insert BST
15. Binary Search Tree/kth_Smallest_BST.cpp:69
↓ 1 callersFunctioninsert
Recursive function to insert a key into BST
15. Binary Search Tree/Target Sum Pair In Bst.cpp:22
↓ 1 callersMethodinsert
(int key)
06. Sorting/Treesort.java:32
↓ 1 callersMethodinsert
(int data)
10. Linked List/java/pattern.java:17
↓ 1 callersFunctioninsertAtBottom
11. Stack/reverse_stack_const_space.cpp:15
↓ 1 callersMethodinsertAtEnd
30. CPP Programs/fortune-teller.cpp:224
↓ 1 callersFunctioninsertAtHead
Insert at Head in list
10. Linked List/LinkedListBasic-Operations.cpp:29
↓ 1 callersFunctioninsertAtHeadCll
10. Linked List/cpp/Linked List Complete.cpp:343
↓ 1 callersFunctioninsertAtHeadDll
10. Linked List/cpp/Linked List Complete.cpp:277
↓ 1 callersFunctioninsertAtMiddle
Insert at Middle in list at position x
10. Linked List/LinkedListBasic-Operations.cpp:36
↓ 1 callersFunctioninsertAtTail
Insert at Tail in list
10. Linked List/LinkedListBasic-Operations.cpp:50
↓ 1 callersFunctioninsertBeg
10. Linked List/c lang/DoublyLinkedList/Inserting.c:47
↓ 1 callersFunctioninsertBeg
10. Linked List/c lang/CircularDoublyLinkedList/Inserting.c:56
↓ 1 callersFunctioninsertBeg
10. Linked List/c lang/SinglyLinkedList/Inserting.c:43
↓ 1 callersFunctioninsertBeg
10. Linked List/c lang/CircularLinkedList/Inserting.c:46
↓ 1 callersFunctioninsertNode
20. Dynamic Programming/wordBreakAllMethods.cpp:18
↓ 1 callersFunctioninsertPos
10. Linked List/c lang/DoublyLinkedList/Inserting.c:60
↓ 1 callersFunctioninsertPos
10. Linked List/c lang/CircularDoublyLinkedList/Inserting.c:77
↓ 1 callersFunctioninsertPos
10. Linked List/c lang/SinglyLinkedList/Inserting.c:51
↓ 1 callersFunctioninsertPos
10. Linked List/c lang/CircularLinkedList/Inserting.c:61
↓ 1 callersMethodinsertRec
(Node root, int key)
06. Sorting/Treesort.java:39
↓ 1 callersFunctioninsert_at_bottom
Below is a recursive function that inserts an element at the bottom of a stack.
03. Recursion/Reverseastack.cpp:17
↓ 1 callersFunctioninsert_at_first
10. Linked List/cpp/LinkedListOperations.cpp:29
↓ 1 callersFunctioninsert_at_last
10. Linked List/cpp/LinkedListOperations.cpp:42
↓ 1 callersFunctioninsert_at_mid
10. Linked List/cpp/LinkedListOperations.cpp:58
↓ 1 callersFunctioninsert_at_particular_postion
FUNCTION TO INSERT AT PARTICULAR POSITION
10. Linked List/cpp/INSERTION AT PARTICULAR POSITION.cpp:23
↓ 1 callersFunctioninsert_at_position
10. Linked List/LinkedListMenu.cpp:49
↓ 1 callersMethodinsert_before
10. Linked List/DoublyLinkedList/Insertion_in_Doublylinkedlist.cpp:160
↓ 1 callersFunctioninsert_beg
10. Linked List/LinkedListMenu.cpp:18
↓ 1 callersFunctioninsert_beg
10. Linked List/cpp/BasicoperationsonDLL.cpp:72
↓ 1 callersFunctioninsert_begin
10. Linked List/c lang/all_func.c:119
↓ 1 callersFunctioninsert_end
10. Linked List/cpp/BasicoperationsonDLL.cpp:90
↓ 1 callersFunctioninsert_end
10. Linked List/c lang/Linked List.c:282
↓ 1 callersFunctioninsert_end
10. Linked List/c lang/all_func.c:130
↓ 1 callersFunctioninsert_front
10. Linked List/c lang/Linked List.c:269
↓ 1 callersFunctioninsert_pos
10. Linked List/cpp/BasicoperationsonDLL.cpp:108
↓ 1 callersFunctioninsert_position
10. Linked List/c lang/all_func.c:146
↓ 1 callersFunctioninsert_pque
Inserting edges in the priority queue */
17. Graph/Kruskals_Algorithm.c:117
↓ 1 callersFunctioninsert_sort
10. Linked List/c lang/Linked List.c:297
↓ 1 callersFunctioninsert_tree
Inserting an edge in the tree */
17. Graph/Kruskals_Algorithm.c:107
↓ 1 callersFunctioninsertatbottom
03. Recursion/reverse_stack.cpp:8
↓ 1 callersFunctioninsertatend
10. Linked List/llinsertion_atend.cpp:15
↓ 1 callersFunctioninsertatfirst
10. Linked List/llinsertion_atfirst.cpp:15
↓ 1 callersFunctioninsertatnode
10. Linked List/llinsertion_afternode.cpp:15
↓ 1 callersFunctioninsertbeg
10. Linked List/c lang/Implementation Of Circular Linked List.c:17
↓ 1 callersFunctioninsertend
10. Linked List/c lang/Implementation Of Circular Linked List.c:37
↓ 1 callersFunctioninsertion
(arr,n)
06. Sorting/Insertion_Sort.py:1
↓ 1 callersFunctioninsertion
(arr,n)
06. Sorting/insertion_sort.py:1
↓ 1 callersFunctioninsertion
10. Linked List/llinsertion.cpp:15
↓ 1 callersFunctioninsertionSort
This function sorts array from left index to to right index which is of size atmost RUN
06. Sorting/Timsort.cpp:8
↓ 1 callersFunctioninsertionSort
(b)
06. Sorting/bucket_sort.py:2
↓ 1 callersFunctioninsertionSort
Function to sort an array using insertion sort*/
06. Sorting/insertion sort.c:6
↓ 1 callersFunctioninsertionSort
(arr []int)
06. Sorting/InsertionSort.go:17
↓ 1 callersFunctioninsertionSort
Function to sort an array using insertion sort*/
04. Arrays/insertion_short.cpp:5
↓ 1 callersFunctioninsertrbtree
14. Tree/red_black_tree.c:72
← previousnext →1,201–1,300 of 4,122, ranked by callers