Love this SO MUCH!!!!!!
Philippe Claudel, Brodeck
SPREAD THE WORD:
THE NETHERLANDS IS PLANNING ON MAKING A LAW AGAINST CATCALLING AND INTIMIDATING OF WOMEN.
THIS IS AMAZING PROGRESS !!!
THE ASSOCIATION OF MEN EMANCIPATION IS TELLING ALL THE FATHERS TO NOT ONLY TELL YOUR DAUGHTERS TO BE CAREFUL BUT ALSO TELL YOUR SONS TO TREAT A WOMAN AS AN EQUAL!
PLEASE VOTE HERE : CLICK
IF YOU DONT UNDERSTAND JUST ASK ME AND WE’LL WORK IT OUT !
LET’S MAKE THIS HAPPEN!
Are you interested in Computer Science or Technology? Well, you should check out my new blog that is devoted to the subjects. There I will be posting tons of mind blowing facts about computers and how they operate and the amazing things that they can do. If you’ve ever been curious about…
Less than 1% of women going to college plan to major in computer science, according to the American Association of University Women. Those are bleak numbers.
What will prompt more women to get into coding? The first step: paying teachers to recruit girls to take coding classes.
With $1 million in funding from Google’s Made With Code initiative, nonprofit DonorsChoose.org is rewarding teachers with money when they get four or more female students to complete a coding class online.
The Quicksort Algorithm
Quicksort is the fastest known comparison-based sorting algorithm (on average, and for a large number of elements), requiring O(n log(n)) steps. By convention, n is the number of elements to be compared and big O is a function of those elements. Quicksort is a recursive algorithm which first partitions an array according to several rules:
- Pick an element, called a pivot, from the array.
- Reorder the array so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.
- Recursively apply the above steps to the sub-array of elements with smaller values and separately to the sub-array of elements with greater values.
Quicksort was invented by Tony Hoare and has undergone extensive analysis and scrutiny, and is known to be about twice as fast as the next fastest sorting algorithm. In the worst case, however, quicksort is a slow n² algorithm (and for quicksort, “worst case” corresponds to already sorted). (Click this link for an example of the Quicksort Algorithm written in C)
Credit: Wolfram Alpha/Wikipedia