Skip to content
Home
Post Code
Jass (Warcraft III)
Wurst
GUI (Warcraft III)
Galaxy (StarCraft II)
GUI (StarCraft II)
C++
Java
Delphi
Text
Search Code
Compare Code
Uploads
Draw
Create New Drawing
View Drawings
Graph
Log in
[code]a_deleteDuplicates[b]([/b] A[b][[/b] [color=FFFF77]0[/color]...n [b]-[/b] [color=FFFF77]1[/color] [b]][/b] [b])[/b] :A'[b][[/b] [color=FFFF77]0[/color]...n [b]-[/b] [color=FFFF77]1[/color] [b]][/b] [b]{[/b] buildHeap[b]([/b] A [b])[/b] [color=999999][i]// as it's done in heapsort[/i][/color] [color=7777FF][b]for[/b][/color][b]([/b] i [b]=[/b] n downto [color=FFFF77]2[/color] [b])[/b] do [b]{[/b] temp : [b]=[/b] Heap.deleteMin [b]}[/b] [color=7777FF][b]if[/b][/color][b]([/b] A'[b][[/b] i [b]-[/b] [color=FFFF77]1[/color] [b]][/b] [b]![/b][b]=[/b] temp [b])[/b] [b]{[/b] A'[b][[/b] i [b]][/b] : [b]=[/b] temp [b]}[/b] [b]}[/b] b_deleteDuplicates[b]([/b] A[b][[/b] [color=FFFF77]0[/color]...n [b]-[/b] [color=FFFF77]1[/color] [b]][/b] [b])[/b] :A'[b][[/b] [color=FFFF77]0[/color]...n [b]-[/b] [color=FFFF77]1[/color] [b]][/b] [b]{[/b] [color=7777FF][b]for[/b][/color][b]([/b] i [b]=[/b] [color=FFFF77]0[/color] to n [b]-[/b] [color=FFFF77]1[/color] [b])[/b] do [b]{[/b] A'[b][[/b] i [b]][/b] : [b]=[/b] [color=7777FF][b]null[/b][/color] [b]}[/b] [color=7777FF][b]for[/b][/color][b]([/b] i [b]=[/b] [color=FFFF77]0[/color] to n [b]-[/b] [color=FFFF77]1[/color] [b])[/b] do [b]{[/b] h: [b]=[/b] H[b]([/b] A[b][[/b] i [b]][/b] [b])[/b] [color=999999][i]// H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet[/i][/color] A'[b][[/b] h [b]][/b] : [b]=[/b] A[b][[/b] i [b]][/b] [b]}[/b] [b]}[/b] [color=7777FF][b]return[/b][/color] A' [/code]
Diesen Code in Original-Formatierung anzeigen
select language
> jass
java
delphi
C++
php
GSL
galaxy
visualBasic
wurst
Text
Markdown
select style
default
> bbcode - default
Jasscraft
jasscraft html
visual
lightweight
lightweightNr
goto line:
Compare with:
text copy window
edit this code
post new code
a_deleteDuplicates( A[ 0...n - 1 ] ) :A'[ 0...n - 1 ] { buildHeap( A ) // as it's done in heapsort for( i = n downto 2 ) do { temp : = Heap.deleteMin } if( A'[ i - 1 ] != temp ) { A'[ i ] : = temp } } b_deleteDuplicates( A[ 0...n - 1 ] ) :A'[ 0...n - 1 ] { for( i = 0 to n - 1 ) do { A'[ i ] : = null } for( i = 0 to n - 1 ) do { h: = H( A[ i ] ) // H ist universelle Hashfkt die ganzzahlig in [0,...,n-1] abbildet A'[ h ] : = A[ i ] } } return A'