Union leader was killed by leasing company

An union leader attacked by leasing company…!

 

These days there is a huge discussion about government registered leasing companies. Because a man named sunil jayawardena  the tree wheeler trade union leader was killed by some gagsters in relevant leasing company. Government said that company is not registered in central bank.  The best thing is when people want to get a lease, search about the leasing company. The registered companies are published in gazette and central bank website. Refer them and get idea before moving to the lease…

Click below link find registered leasing companies in sri lanka.

https://www.cbsl.gov.lk/en/authorized-financial-institutions/registered-finance-leasing-establishments


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