MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / max

Function max

Trees/avltree.c:23–26  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

21}
22
23int max(int a, int b)
24{
25 return (a > b) ? a : b;
26}
27
28// Create a node
29struct Node *newNode(int key)

Callers 15

rightRotateFunction · 0.70
leftRotateFunction · 0.70
insertNodeFunction · 0.70
deleteNodeFunction · 0.70
kadanes_algorithmFunction · 0.50
max_circular_subarrayFunction · 0.50
maxProfitMethod · 0.50
maxProfitMethod · 0.50
sortUsingHashFunction · 0.50
biggest_oddFunction · 0.50
bucketSortFunction · 0.50
robFunction · 0.50

Calls

no outgoing calls

Tested by

no test coverage detected