Skip to main content

Ecosia

ECOSIA - A Green search engine
“ Ecosia donates 80% profits to planting trees”
Site: www.ecosia.org
Lauched on 7 th December 2009 and created by Christian Kroll available in more than 26 language. It is located in Berlin, Germany.It is also called as CO2-neutral company.Ecosia has donated to different tree-planting programs. Until December 2010 Ecosia’s donations went to a program by WWF
Germany that protected the Juruena-National park in the Amazonas. In order to make sure the
protection was kept up, the program also drew up and financed plans with timber companies and the  local communities.
According to B-labs, as of January 2015, "In donating 80 percent of its ad revenue, the
search engine has raised over $1.5 million for rainforest protection since its founding in December
2009." According to Ecosia, by 2015, the search engine had almost 2.5 million active users, and
searches through it had resulted in more than 2 million trees being planted.Since October 2014, Ecosia
is donating to the project "Greening the desert" by the organization WeForest which aims at
reforesting certain areas in northern Burkina Faso. This project will make up part of the so-called
"Great Green Wall" in the Sahel.
In May 2015, Ecosia was shortlisted for The Europas, the European Tech Startups
Awards, under the category Best European Startup Aimed At Improving Society.As of 27 April 2016,
Ecosia ranks in the top 2 start-up for Germany in the StartupRanking.On 7 September 2016, Ecosia
claimed to have reached the milestone of 5 million trees planted.
Ecosia is powered by Bing(Microsoft search engine) and generate income by ads
displayed in search result paid by Microsoft bing partners .It also raises its funds through its other
product EcoLinks addon for browser which allow user to donate ecosia through their online purchases
Every search it earns 0.5 Euro cents.It takes about 56 searches(0.28 EUR) to fund
planting of single tree ( consulted on December 1,2016)
Web browser which support Ecosia as default search engine are Pale Moon( a firefox
based browser ) on January 26,2016 and in Polarity web browser in version 8 from February 15,2016
and waterfox web browser from version 44.0.2+
Labels:

Comments

Post a Comment

Popular posts from this blog

codefest-ctf-18 writeup

Codefest is online CTF challenge conducted by Hackerrank on August 31 2018 6:00 PM IST to September 1 2018 12:00 PM IST. They have given dozens of challenges.  link: https://www.hackerrank.com/contests/codefest-ctf-18/challenges I manage to complete two challenges in this article i will explain how i solved the two  Typing Master Question If you think you have it in you, connect now to 34.216.132.109 9093 and prove your mettle. You will be presented with a simple typing task which is meant to check your typing speed. For example, Can you type 'Z' 10 times followed by 'u' 6 times, followed by the sum of their ASCII values? ZZZZZZZZZZuuuuuu207 Input Format Regarding input to the server - The question was designed keeping netcat in mind. Some users who are using other tools/language (eg, Python, PuTTY, TELNET) to connect to the server please note that they do not terminate the strings like netcat does. If you choose not to use netcat, t...
1 comment
Read more

C program jackpot

/*Program to show sum of 10 elements of array & show the average.*/ #include<stdio.h> int main () { int a[ 10 ],i,sum = 0 ; float av; printf( "enter elements of an aaray: " ); for (i = 0 ;i < 10 ;i ++ ) scanf( "%d" , & a[i]); for (i = 0 ;i < 10 ;i ++ ) sum = sum + a[i]; printf( "sum=%d" ,sum); av = sum / 10 ; printf( "average=%.2f" ,av); return 0 ; } Output: enter elements of an array : 4 4 4 4 4 4 4 4 4 4 sum = 40 average = 4.00 /*Program to find the maximum no. in an array.*/ #include<stdio.h> void main () { int a[ 5 ],max,i; printf( "enter element for the array: " ); for (i = 0 ;i < 5 ;i ++ ) scanf( "%d" , & a[i]); max = a[ 0 ]; for (i = 1 ;i < 5 ;i ++ ) { if (max < a[i]) max = a[i]; } printf( "maximum no= %d" ,max); } Output: enter elements for array : 5 4 7 1 2 maximum no = 7 /*Swapp...
Post a Comment
Read more