Update README.md

Author: AvinandanBose

README.md

@@ -1644,6 +1644,43 @@ $\frac{𝒏}{𝒍𝒐𝒈𝒏}$</h3>
 
 </ul>
 
+<h2></h2>
+<h2>𝑽𝑰𝑰)𝑪𝒐𝒏𝒅𝒊𝒕𝒊𝒐𝒏𝒂𝒍 𝑨𝒔𝒚𝒎𝒑𝒕𝒐𝒕𝒊𝒄𝒔</h2>
+
+<ul>
+  
+<h3>𝑪𝒐𝒏𝒅𝒊𝒕𝒊𝒐𝒏𝒂𝒍 𝒂𝒔𝒚𝒎𝒑𝒕𝒐𝒕𝒊𝒄𝒔 𝒊𝒔 𝒂 𝒕𝒆𝒄𝒉𝒏𝒊𝒒𝒖𝒆 𝒕𝒐 𝒔𝒐𝒍𝒗𝒆 𝒂
+𝒓𝒆𝒄𝒖𝒓𝒓𝒆𝒏𝒄𝒆 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 𝒊𝒇 𝒕𝒉𝒆 𝒓𝒆𝒄𝒖𝒓𝒓𝒆𝒏𝒄𝒆 𝒆𝒒𝒖𝒂𝒕𝒊𝒐𝒏 𝒊𝒔
+𝒂𝒔𝒔𝒐𝒄𝒊𝒂𝒕𝒆𝒅 𝒘𝒊𝒕𝒉 𝒂 𝒄𝒐𝒏𝒔𝒕𝒓𝒂𝒊𝒏𝒕 𝒐𝒏 `𝒏`. 𝑻𝒉𝒊𝒔 𝒄𝒂𝒏 𝒃𝒆
+𝒂𝒄𝒄𝒐𝒎𝒑𝒍𝒊𝒔𝒉𝒆𝒅 𝒃𝒚 𝒂𝒑𝒑𝒍𝒚𝒊𝒏𝒈 𝒕𝒉𝒆 <ins>𝒔𝒎𝒐𝒐𝒕𝒉𝒏𝒆𝒔𝒔 𝒓𝒖𝒍𝒆.</ins> </h3>
+
+<h3>𝑭𝒐𝒓𝒎𝒂𝒍𝒍𝒚, 𝒕𝒉𝒆 𝒔𝒎𝒐𝒐𝒕𝒉𝒏𝒆𝒔𝒔 𝒓𝒖𝒍𝒆 𝒄𝒂𝒏 𝒃𝒆 𝒔𝒕𝒂𝒕𝒆𝒅 𝒂𝒔 𝒇𝒐𝒍𝒍𝒐𝒘𝒔:</h3>
+
+<ul>
+  
+<h3>𝑰𝒇 𝒇(𝒏) 𝒊𝒔 𝒂𝒏 𝒆𝒗𝒆𝒏𝒕𝒖𝒂𝒍𝒍𝒚 𝒏𝒐𝒏 − 𝒅𝒆𝒄𝒓𝒆𝒂𝒔𝒊𝒏𝒈 𝒂𝒏𝒅
+𝒔𝒎𝒐𝒐𝒕𝒉 𝒇𝒖𝒏𝒄𝒕𝒊𝒐𝒏 , 𝒕𝒉𝒆𝒏 𝑻(𝒏) 𝒊𝒔 𝚯(𝒇(𝒏)) 𝒘𝒉𝒆𝒏𝒆𝒗𝒆𝒓 𝒕(𝒏) 𝒊𝒔
+𝚯(𝒇(𝒏) | 𝒏 𝒊𝒔 𝒂 𝒑𝒐𝒘𝒆𝒓 𝒐𝒇 𝒃) .</h3>
+
+</ul>
+
+
+<h3><a href="https://github.com/AvinandanBose/Time_Complexity_Calculation_Of_Recursion/blob/main/B.B.15.Conditional%20Asymptotics.pdf"> 𝑪𝒐𝒏𝒅𝒊𝒕𝒊𝒐𝒏𝒂𝒍 𝑨𝒔𝒚𝒎𝒑𝒕𝒐𝒕𝒊𝒄𝒔-𝑰𝒏 𝑫𝒆𝒕𝒂𝒊𝒍𝒔</a></h3>
+
+
+<h2></h2>
+<h2>𝑪𝒐𝒏𝒅𝒊𝒕𝒊𝒐𝒏𝒂𝒍 𝑨𝒔𝒚𝒎𝒑𝒕𝒐𝒕𝒊𝒄𝒔-𝑬𝒙𝒂𝒎𝒑𝒍𝒆</h2>
+
+<ul>
+
+<h3>  𝑻(𝒏) ∈ {𝚯(𝒍𝒐𝒈𝟐𝒏| 𝒏 𝒊𝒔 𝒂 𝒑𝒐𝒘𝒆𝒓 𝒐𝒇 𝟐)} →<a href="https://github.com/AvinandanBose/Time_Complexity_Calculation_Of_Recursion/blob/main/B.B.15.A.Conditional%20Asymptotics-Example1.pdf">𝑬𝒙𝒂𝒎𝒑𝒍𝒆 </h3>
+
+</ul>
+
+</ul>
+
+
+
 
 </ul>
 </ul>
@@ -1652,3 +1689,8 @@ $\frac{𝒏}{𝒍𝒐𝒈𝒏}$</h3>
 
 
 </ul>
+
+<br>
+<br>
+
+<h1 align="Center">********************* XXXXX   *************************</h1>