diff --git a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html index ad03856d..740c7ebf 100644 --- a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html +++ b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html @@ -210,88 +210,90 @@ LeetCode Algorithm 217 Contains Duplicate C Easy +223 Rectangle Area C Medium + 226 Invert Binary Tree C Easy - + 231 Power of Two C Easy - + 234 Palindrome Linked List C Easy - + 242 Valid Anagram C Easy - + 268 Missing Number C Easy - + 278 First Bad Version C Easy - + 283 Move Zeroes C Easy - + 287 Find the Duplicate Number C Medium - + 344 Reverse String C Easy - + 367 Valid Perfect Square C Easy - + 387 First Unique Character in a String C Easy - + 389 Find the Difference C Easy - + 404 Sum of Left Leaves C Easy - + 442 Find All Duplicates in an Array C Medium - + 461 Hamming Distance C Easy - + 476 Number Complement C Easy - + 509 Fibonacci Number C Easy - + 520 Detect Capital C Easy - + 561 Array Partition I C Easy - + 617 Merge Two Binary Trees C Easy - + 647 Palindromic Substring C Medium - + 674 Longest Continuous Increasing Subsequence C Easy - + 700 Search in a Binary Search Tree C Easy - + 701 Insert into a Binary Search Tree C Medium - + 704 Binary Search C Easy - + 709 To Lower Case C Easy - + 771 Jewels and Stones C Easy - + 852 Peak Index in a Mountain Array C Easy - + 876 Middle of the Linked List C Easy - + 905 Sort Array By Parity C Easy - + 917 Reverse Only Letters C Easy - + 938 Range Sum of BST C Easy - + 965 Univalued Binary Tree C Easy - + 977 Squares of a Sorted Array C Easy - + 1009 Complement of Base 10 Integer C Easy - + 1089 Duplicate Zeros C Easy - + 1184 Distance Between Bus Stops C Easy - + 1189 Maximum Number of Balloons C Easy - + 1207 Unique Number of Occurrences C Easy - -1524 Number of Sub-arrays With Odd Sum C Medium -1752 Check if Array Is Sorted and Rotated C Easy +1524 Number of Sub-arrays With Odd Sum C Medium +1752 Check if Array Is Sorted and Rotated C Easy + 2130 Maximum Twin Sum of a Linked List C Medium diff --git a/d9/dcc/prim_8c.html b/d9/dcc/prim_8c.html index 1b99f744..9d90224c 100644 --- a/d9/dcc/prim_8c.html +++ b/d9/dcc/prim_8c.html @@ -277,19 +277,18 @@ Here is the call graph for this function:
Returns
index of minimum element in arr
46{
47 uint16_t index = 0;
-
48 uint16_t min = INF;
+
48 uint16_t min = INF;
49
50 for (uint16_t i = 0; i < N; i++)
51 {
-
52 if (arr[i] < min)
+
52 if (arr[i] < min)
53 {
-
54 min = arr[i];
+
54 min = arr[i];
55 index = i;
56 }
57 }
58 return index;
59}
-
min
#define min(a, b)
shorthand for minimum value
Definition: kohonen_som_topology.c:43
diff --git a/globals_defs.html b/globals_defs.html index 7f5c41fd..7693fab7 100644 --- a/globals_defs.html +++ b/globals_defs.html @@ -144,8 +144,8 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(

- m -

diff --git a/globals_i.html b/globals_i.html index 50f4578f..98b066aa 100644 --- a/globals_i.html +++ b/globals_i.html @@ -120,8 +120,8 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
  • isEmpty() : infix_to_postfix.c, infix_to_postfix2.c
  • isOprnd() : infix_to_postfix.c
  • isPalindrome() : palindrome.c
    • -
  • isprime() : sol1.c
  • isPrime() : prime.c
    • +
  • isprime() : sol1.c
  • isStrong() : strong_number.c
    • diff --git a/globals_m.html b/globals_m.html index c288459d..6d816626 100644 --- a/globals_m.html +++ b/globals_m.html @@ -105,8 +105,8 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
  • malloc_dbg() : malloc_dbg.c, malloc_dbg.h
  • mat_3x3 : geometry_datatypes.h
  • mat_mul() : qr_eigen_values.c
    • -
  • max : kohonen_som_topology.c, kohonen_som_trace.c
  • MAX : client.c, server.c, prim.c, bubble_sort_2.c
    • +
  • max : kohonen_som_topology.c, kohonen_som_trace.c
  • MAX_ADALINE_ITER : adaline_learning.c
  • MAX_DENO : sol1.c
  • MAX_DIGITS : sol1.c
    • diff --git a/search/all_b.js b/search/all_b.js index c43fe7af..7e646be6 100644 --- a/search/all_b.js +++ b/search/all_b.js @@ -27,7 +27,7 @@ var searchData= ['isempty_24',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s): infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty(): infix_to_postfix2.c']]], ['isoprnd_25',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]], ['ispalindrome_26',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]], - ['isprime_27',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]], - ['isprime_28',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]], + ['isprime_27',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]], + ['isprime_28',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]], ['isstrong_29',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]] ]; diff --git a/search/all_f.js b/search/all_f.js index 7d9bf790..2d70ef79 100644 --- a/search/all_f.js +++ b/search/all_f.js @@ -10,8 +10,8 @@ var searchData= ['mat_5f3x3_5f_7',['mat_3x3_',['../d9/d8b/structmat__3x3__.html',1,'']]], ['mat_5fmul_8',['mat_mul',['../d7/d50/qr__eigen__values_8c.html#a5835240036dc02ee9a13e65c559fb907',1,'qr_eigen_values.c']]], ['matrix_20operations_9',['Matrix operations',['../dd/d7a/group__matrix.html',1,'']]], - ['max_10',['max',['../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max(): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max(): kohonen_som_trace.c']]], - ['max_11',['MAX',['../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): client.c'],['../d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): server.c'],['../d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): prim.c'],['../d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): bubble_sort_2.c']]], + ['max_10',['MAX',['../dd/d93/client_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): client.c'],['../d1/d20/server_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): server.c'],['../d9/dcc/prim_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): prim.c'],['../d2/d6d/bubble__sort__2_8c.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): bubble_sort_2.c']]], + ['max_11',['max',['../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max(): kohonen_som_topology.c'],['../d0/dcb/group__kohonen__1d.html#gaffe776513b24d84b39af8ab0930fef7f',1,'max(): kohonen_som_trace.c']]], ['max_5fadaline_5fiter_12',['MAX_ADALINE_ITER',['../da/d2a/group__adaline.html#ga555ba960994e9bccb2029764588f694f',1,'adaline_learning.c']]], ['max_5fdeno_13',['MAX_DENO',['../d1/df9/problem__26_2sol1_8c.html#a619eec3220cebd7c5e455edbb14e9b12',1,'sol1.c']]], ['max_5fdigits_14',['MAX_DIGITS',['../d8/d32/problem__25_2sol1_8c.html#a001791a21d538b8b9176287ae60d9b61',1,'sol1.c']]], diff --git a/search/functions_9.js b/search/functions_9.js index f8cdfa79..99456305 100644 --- a/search/functions_9.js +++ b/search/functions_9.js @@ -19,7 +19,7 @@ var searchData= ['isempty_16',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s): infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty(): infix_to_postfix2.c']]], ['isoprnd_17',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]], ['ispalindrome_18',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]], - ['isprime_19',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]], - ['isprime_20',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]], + ['isprime_19',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]], + ['isprime_20',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]], ['isstrong_21',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]] ];