Poson poya day is today...

Sri lankan Buddhists Celebrates Poson Poya Day

sri lanka got buddhism   in 236 BC. During that period King Devanampiyatissa( dewana pethis) controled our country.The festival is the most important Poya (full moon) holiday of the year and the second most important Buddhist holiday of the year, being surpassed in importance by Vesak. 

Mihindu thero along with Ithtiya,Uththiya, Sambala,Bhadrasala, Sumana Samanera and Bhanduka upasaka came to

 Minhinthalae Stone area . sri lankan buddhist people Celebrate poson poya annually in june month. As well as there 

are some Perahara festivals in memory of this poya day.  



Comments

Post a Comment

Popular posts from this blog

Insertion Sort - Time Complexity

Image
 Time Complexity of Insertion Sort Selection Sort is using two for loops to do one iteration. The first loop (Outer loop ) travels through an array starting from index 0, while the inner loop runs from index i+1 to index less than i. The following diagram shows the Number of execution rounds it performs. when i is 0,, j is 1,  the inner for loop runs n-1 time. when i is 1, j is 2, the inner for loop runs n-2 times. Likewise, when i is n, j is n+1,  the inner for loop runs n times. So the total number of Execution rounds can be calculated by adding all Execution times in each i values.  Time Complexity =    n-1 (n-1)                                              2            ...
Read more

Selection Sort - Time Complextity

Image
  Time Complexity of Selection Sort  Selection sort  is using two for loops to do one iteration. The first loop (Outer loop ) travels through an array starting from index 1, while the inner loop runs from index 1 to index i-1. The following diagram shows the Number of execution rounds it performs. when i is 1, the inner for loop runs only one time. when i is 2, inner for loop runs 2 times. Likewise when i is   n   the inner for loop runs n times. So the total number of Execution rounds can be calculated by adding all Execution times in each i values.     Time Complexity       =    n (n+1)                                         2                     ...
Read more

Quick Sort - Time Complexity

Image
 Time Complexity of Quick Sort Algorithm:                            QuickSort(left, right){                                   If(left < right){                                              Pi= partition(left,right)                                                QuickSort(left,pi)                                         ...
Read more