Presentation is loading. Please wait.

Presentation is loading. Please wait.

Quicksort nach Hoare. Liste von int-Werten 7675888604182774986 4975841608882777686.

Published byJessica Coleman Modified over 10 years ago

Similar presentations

Presentation on theme: "Quicksort nach Hoare. Liste von int-Werten 7675888604182774986 4975841608882777686."— Presentation transcript:

1 Quicksort nach Hoare

2 Liste von int-Werten 7675888604182774986 4975841608882777686

3 4975841608882777686 60 4975841 8882777686 7495841 7677828886

4 60 4975841 8882777686 7495841 7677828886 7 60 77 495841 76 828886 494158 76 828688

5 7 58607677 88 49 41 8286 4149 8286 7 60 77 495841 76 828886 494158 76 828688

6 7 58607677 88 49 41 8286 4149 8286 7 495860767782 88 41 86 41 86

7 7 495860767782 88 41 86 41 86 7414958607677828688

8 public static void quickSort(int[] liste){ int untereGrenze = 0; int obereGrenze = liste.length-1; quickSort(liste, untereGrenze,obereGrenze); }

9 private static void quickSort(int[] liste, int untereGrenze, int obereGrenze) { int links = untereGrenze; int rechts = obereGrenze; int pivot = liste[((untereGrenze + obereGrenze) / 2)]; do { while (liste[links] < pivot) { links++; } while (pivot < liste[rechts]) { rechts--; } if (links <= rechts) { int tmp = liste[links]; liste[links] = liste[rechts]; liste[rechts] = tmp; links++; rechts--; } } while (links <= rechts); if (untereGrenze < rechts) liste = quickSort(liste, untereGrenze, rechts); if (links < obereGrenze) liste = quickSort(liste, links, obereGrenze); }

Download ppt "Quicksort nach Hoare. Liste von int-Werten 7675888604182774986 4975841608882777686."

Similar presentations

Números.

Números.
Complete Structure class Date {class Date { private :private : // private data and functions// private data and functions public :public : // public data.

Complete Structure class Date {class Date { private :private : // private data and functions// private data and functions public :public : // public data.
Continuation of chapter 6…. Nested while loop A while loop used within another while loop is called nested while loop. Q. An illustration to generate.

Continuation of chapter 6…. Nested while loop A while loop used within another while loop is called nested while loop. Q. An illustration to generate.
Chapter 14 Recursion Lecture Slides to Accompany An Introduction to Computer Science Using Java (2nd Edition) by S.N. Kamin, D. Mickunas,, E. Reingold.

Chapter 14 Recursion Lecture Slides to Accompany An Introduction to Computer Science Using Java (2nd Edition) by S.N. Kamin, D. Mickunas,, E. Reingold.
Democracy Deferred: W.E.B. Du Bois I sit with Shakespeare and he flinches not (Political Science 565)

Democracy Deferred: W.E.B. Du Bois I sit with Shakespeare and he flinches not (Political Science 565)
Addition and Subtraction Equations

Addition and Subtraction Equations
STEM AND LEAF PLOTS. Vocabulary Leaf – the last number Stem – anything to the left of the very last number (sometimes that is 0 ; sometimes it is two.

STEM AND LEAF PLOTS. Vocabulary Leaf – the last number Stem – anything to the left of the very last number (sometimes that is 0 ; sometimes it is two.
Massachusetts 2009 Child Care Market Price Study Mills Consulting Group, Inc. Goodman Research Group, Inc. The Massachusetts CCRR Network.

Massachusetts 2009 Child Care Market Price Study Mills Consulting Group, Inc. Goodman Research Group, Inc. The Massachusetts CCRR Network.
The 5S numbers game..

The 5S numbers game..
The basics for simulations

The basics for simulations
Connecticut Mastery Test (CMT) and the Connecticut Academic Achievement Test (CAPT) Spring 2013 Presented to the Guilford Board of Education September.

Connecticut Mastery Test (CMT) and the Connecticut Academic Achievement Test (CAPT) Spring 2013 Presented to the Guilford Board of Education September.
Stem-and-Leaf & Scatter Plots Absent 1/28,29 Mean: Average Add up all the numbers and divide by how many numbers you have in your data ex: 1, 4, 5, 7,

Stem-and-Leaf & Scatter Plots Absent 1/28,29 Mean: Average Add up all the numbers and divide by how many numbers you have in your data ex: 1, 4, 5, 7,
For(int i = 1; i

For(int i = 1; i
1 public class Newton { public static double sqrt(double c) { double epsilon = 1E-15; if (c < 0) return Double.NaN; double t = c; while (Math.abs(t - c/t)

1 public class Newton { public static double sqrt(double c) { double epsilon = 1E-15; if (c < 0) return Double.NaN; double t = c; while (Math.abs(t - c/t)
Area under curves Consider the curve y = f(x) for x  [a, b] The actual area under the curve is 83.60 units 2 The approximate area is the sum of areas.

Area under curves Consider the curve y = f(x) for x  [a, b] The actual area under the curve is units 2 The approximate area is the sum of areas.
Before Between After.

Before Between After.
 Find the difference between the two numbers on the red boxes.  If the difference of the red boxes matches the blue box say “deal” f not, it’s “no.

 Find the difference between the two numbers on the red boxes.  If the difference of the red boxes matches the blue box say “deal” f not, it’s “no.
2.10% more children born Die 0.2 years sooner Spend 95.53% less money on health care No class divide 60.84% less electricity 84.40% less oil.

2.10% more children born Die 0.2 years sooner Spend 95.53% less money on health care No class divide 60.84% less electricity 84.40% less oil.
Foundation Stage Results 20082009201020112012 CLL (6 or above) 79% 73.5%79.4%86.5% M (6 or above) 91%99%97%99% PSE (6 or above) 96%84%100%91.2%97.3% CLL.

Foundation Stage Results CLL (6 or above) 79% 73.5%79.4%86.5% M (6 or above) 91%99%97%99% PSE (6 or above) 96%84%100%91.2%97.3% CLL.
1 Non Deterministic Automata. 2 Alphabet = Nondeterministic Finite Accepter (NFA)

1 Non Deterministic Automata. 2 Alphabet = Nondeterministic Finite Accepter (NFA)

Similar presentations

Ads by Google