橡ソート手順比較
|
|
- みそら たかひ
- 5 years ago
- Views:
Transcription
1 PAGE:1
2 [Page] QuickSort 21 QuickSort QuickSort 22 QuickSort QuickSort 23 QuickSort 24 Order QuickSort 27 PAGE:2
3 PAGE:3
4 program sort; { { type item = record id : integer; math : integer; english : integer type ar_int = array[0..51,0..2] of integer; var readfile : file of item ; data : item ; filename : string[12] ; i_data,o_data : ar_int ; flag,flag2,left,right : integer ; g1,g2,lp,temp : longint ; { procedure quick_sort(var o_data : ar_int ; flag,left,right :integer ); var i,j,k,w,some,pivot : integer; some := (left + right ) div 2; pivot := o_data[some,flag]; i := left; j := right; repeat while o_data[i,flag] < pivot do i := i+1; while o_data[j,flag] > pivot do j := j-1; if (i <= j) then for k := 0 to 2 do w := o_data[i,k]; o_data[i,k] := o_data[j,k]; o_data[j,k] := w i := i+1; j := j-1 PAGE:4
5 until i > j; if (j > left) then quick_sort(o_data,flag,left,j); if (i < right) then quick_sort(o_data,flag,i,right) { procedure quick_sort_rev(var o_data : ar_int ; flag,left,right :integer ); var i,j,k,w,some,pivot : integer; some := (left + right ) div 2; pivot := o_data[some,flag] ; i := left; j := right; repeat while o_data[i,flag] > pivot do i := i+1; while o_data[j,flag] < pivot do j := j-1; if (i <= j) then for k := 0 to 2 do w := o_data[i,k]; o_data[i,k] := o_data[j,k]; o_data[j,k] := w i := i+1; j := j-1 until i > j; if (j > left) then quick_sort_rev(o_data,flag,left,j); if (i < right) then quick_sort_rev(o_data,flag,i,right) { procedure sort_ins(var o_data : ar_int ; flag : integer); var i,j,k,w,x,y,z : integer; for i := 2 to 50 do x := o_data[i,0]; y := o_data[i,1]; PAGE:5
6 z := o_data[i,2]; w := o_data[i,flag]; o_data[0,flag] := w; j := i - 1; while w < o_data[j,flag] do o_data[j+1,0] := o_data[j,0]; o_data[j+1,1] := o_data[j,1]; o_data[j+1,2] := o_data[j,2]; j := j-1 o_data[j+1,0] := x; o_data[j+1,1] := y; o_data[j+1,2] := z; o_data[j+1,flag] := w { procedure sort_ins_rev(var o_data : ar_int ; flag : integer); var i,j,k,w,x,y,z : integer; for i := 49 downto 1 do x := o_data[i,0]; y := o_data[i,1]; z := o_data[i,2]; w := o_data[i,flag]; o_data[51,flag] := w; j := i + 1; while w < o_data[j,flag] do o_data[j-1,0] := o_data[j,0]; o_data[j-1,1] := o_data[j,1]; o_data[j-1,2] := o_data[j,2]; j := j+1 o_data[j-1,0] := x; o_data[j-1,1] := y; o_data[j-1,2] := z; o_data[j-1,flag] := w { procedure file_load; assign(readfile,filename); reset(readfile); with data do for temp := 1 to 50 do read(readfile,data); o_data[temp,0] := id; o_data[temp,1] := math; o_data[temp,2] := english; i_data[temp,0] := id; PAGE:6
7 i_data[temp,1] := math; i_data[temp,2] := english; close(readfile) { procedure sort_data; if ( lp >= 20) then g1 := lp div 20; g2 := g1; writeln(' : [~ :',g1,' ',lp,'] write (' (-_-/') else g2 := 999; for temp := 1 to lp do if (g2 < temp) then write('~ g2 := g2 + g1; o_data := i_data; left := 1; right := 50; case flag2 of 1 : sort_ins(o_data,flag); 2 : sort_ins_rev(o_data,flag); 3 : quick_sort(o_data,flag,left,right); 4 : quick_sort_rev(o_data,flag,left,right) writeln('~(^^/ { procedure data_out; writeln(' write('[ ',filename,' ] if flag = 0 then write(' if flag = 1 then write(' if flag = 2 then write(' write(' case flag2 of 1 : write(' 2 : write(' 3 : write('quick Sort 4 : write('quick Sort ') writeln(' writeln('id: MT: EN: writeln(' writeln('id MT EN ID MT EN ID MT EN ID MT EN ID MT EN PAGE:7
8 for temp := 1 to 10 do flag := temp; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+10; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+20; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+30; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+40; writeln(o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' { { writeln(' writeln('created By eucalyptus write (' : readln (filename); { file_load; { writeln(' write('[0: () 1: 2: ]: readln(flag); write('[1: 2: 3:quickSort 4:Quicksort ]: readln(flag2); write(' : readln(lp); { sort_data; { data_out. PAGE:8
9 program sort_o; { { type item = record id : integer; math : integer; english : integer type ar_int = array[0..51,0..2] of integer; var readfile : file of item ; data : item ; filename : string[12] ; i_data,o_data : ar_int ; flag,flag2,left,right : integer ; temp,lp,g1,g2,order : longint ; { procedure quick_sort(var o_data : ar_int ; flag,left,right :integer ; var order : longint); var i,j,k,w,some,pivot : integer; some := (left + right ) div 2; pivot := o_data[some,flag]; i := left; j := right; order := order + 6; repeat while o_data[i,flag] < pivot do i := i+1; order := order + 2 while o_data[j,flag] > pivot do j := j-1; order := order + 2 if (i <= j) then for k := 0 to 2 do w := o_data[i,k]; o_data[i,k] := o_data[j,k]; o_data[j,k] := w; order := order + 4 i := i+1; j := j-1; PAGE:9
10 order := order + 2 order := order + 1 order := order + 1; until i > j; order := order + 1; if (j > left) then order := order + 1; quick_sort(o_data,flag,left,j,order) order := order + 1; if (i < right) then order := order + 1; quick_sort(o_data,flag,i,right,order) { procedure quick_sort_rev(var o_data :ar_int ; flag,left,right :integer ; var order :longint); var i,j,k,w,some,pivot : integer; some := (left + right ) div 2; pivot := o_data[some,flag] ; i := left; j := right; order := order + 6; repeat while o_data[i,flag] > pivot do i := i+1; order := order + 2 while o_data[j,flag] < pivot do j := j-1; order := order + 2 if (i <= j) then for k := 0 to 2 do w := o_data[i,k]; o_data[i,k] := o_data[j,k]; o_data[j,k] := w; order := order + 4 i := i+1; j := j-1; order := order + 2 PAGE:10
11 order := order + 1 order := order + 1; until i > j; order := order + 1; if (j > left) then quick_sort_rev(o_data,flag,left,j,order); order := order + 1 order := order + 1; if (i < right) then quick_sort_rev(o_data,flag,i,right,order); order := order + 1 { procedure sort_ins(var o_data : ar_int ; flag : integer ; var order : longint); var i,j,k,w,x,y,z : integer; for i := 2 to 50 do x := o_data[i,0]; y := o_data[i,1]; z := o_data[i,2]; w := o_data[i,flag]; o_data[0,flag] := w; j := i - 1; order := order + 7; while w < o_data[j,flag] do o_data[j+1,0] := o_data[j,0]; o_data[j+1,1] := o_data[j,1]; o_data[j+1,2] := o_data[j,2]; j := j-1; order := order + 5; o_data[j+1,0] := x; o_data[j+1,1] := y; o_data[j+1,2] := z; o_data[j+1,flag] := w; order := order + 5; { procedure sort_ins_rev(var o_data : ar_int ; flag : integer ; var order : longint); var i,j,k,w,x,y,z : integer; PAGE:11
12 for i := 49 downto 1 do x := o_data[i,0]; y := o_data[i,1]; z := o_data[i,2]; w := o_data[i,flag]; o_data[51,flag] := w; j := i + 1; order := order + 7; while w < o_data[j,flag] do o_data[j-1,0] := o_data[j,0]; o_data[j-1,1] := o_data[j,1]; o_data[j-1,2] := o_data[j,2]; j := j+1; order := order + 5 o_data[j-1,0] := x; o_data[j-1,1] := y; o_data[j-1,2] := z; o_data[j-1,flag] := w; order := order + 4 { procedure file_load; assign(readfile,filename); reset(readfile); with data do for temp := 1 to 50 do read(readfile,data); o_data[temp,0] := id; o_data[temp,1] := math; o_data[temp,2] := english; i_data[temp,0] := id; i_data[temp,1] := math; i_data[temp,2] := english; close(readfile) { procedure sort_data; order := 0; if ( lp >= 20) then g1 := lp div 20; g2 := g1; writeln(' : [~ :',g1,' ',lp,'] write (' (-_-/') else g2 := 999; for temp := 1 to lp do PAGE:12
13 if (g2 < temp) then write('~ g2 := g2 + g1; o_data := i_data; left := 1; right := 50; case flag2 of 1 : sort_ins(o_data,flag,order); 2 : sort_ins_rev(o_data,flag,order); 3 : quick_sort(o_data,flag,left,right,order); 4 : quick_sort_rev(o_data,flag,left,right,order) if (g2 <> 999) then writeln('~(^^/ { procedure data_out; writeln(' write('[ ',filename,' ] if flag = 0 then write(' if flag = 1 then write(' if flag = 2 then write(' write(' case flag2 of 1 : write(' 2 : write(' 3 : write('quick Sort 4 : write('quick Sort ') writeln(' writeln(order,' writeln('id: MT: EN: writeln(' writeln('id MT EN ID MT EN ID MT EN ID MT EN ID MT EN for temp := 1 to 10 do flag := temp; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+10; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+20; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+30; write (o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' flag := temp+40; writeln(o_data[flag,0],' ',o_data[flag,1],' ',o_data[flag,2],' { PAGE:13
14 { writeln(' writeln('created By eucalyptus write (' : readln (filename); { file_load; { writeln(' write('[0: () 1: 2: ]: readln(flag); write('[1: 2: 3:quickSort 4:Quicksort ]: readln(flag2); write(' : readln(lp); { sort_data; { data_out. PAGE:14
15 @echo off del autolog.log echo call stop_w call stop_w call stop_w call stop_w call stop_w call stop_w call stop_w call stop_w call stop_w call stop_w call stop_w call stop_w off BU -e -nsec CLOCKSECOND BU -e -nmin CLOCKMINUTE BU -e -nsec CALC %SEC% + ( %MIN% * 60 ) echo seiseki.dat> autolog.dat echo %2>> autolog.dat echo %3>> autolog.dat echo %1>> autolog.dat sort <autolog.dat >nul BU -e -nsec2 CLOCKSECOND BU -e -nmin CLOCKMINUTE BU -e -nsec CALC %SEC2% + ( %MIN% * 60 ) - SEC echo 1_%2,2_%3,%SEC% >>autolog.log PAGE:15
16 : BU [-w] [-e[str]] [-n[name]] [-r]... [...] ERRORLEVEL Ret. ERRORLEVEL 255 -e )DSPERRORLEVEL DSPERR :,. "-" "/".. * -e[str] (ERRORLEVEL) STR. )BU -e MACHINE * -n[name],-d[name] (NAME ENVTMP) NAME. NAME -n ENVTMP. (-e ret ) )BU -ncdir CURDRVPATH ( : CDIR ) BU -e -nmcode MACHINE (MACHINE MCODE ) n -d. * CLOCKYEAR ( ) * CLOCKMONTH () * CLOCKDAY () * CLOCKWEEK (,0=1=.. 6=) * CLOCKHOUR () * CLOCKMINUTE () * CLOCKSECOND () Ret= * CALC ( ). ERRORLEVEL. ERRORLEVEL 254, BIT. (0-2) ( ) : () : ( ) 1 ++ : 1 PAGE:16
17 2 -- : 1 2 * : ( ) 3 / : ( ) 3 % : ( ) 3 + : ( ) 4 - : ( ) 4 & : AND 5 $ : OR 5 ^ : XOR 5, ( ). Ret= 0253 : 254 : : / / )BU CALC ENVTMP-- BU -e -nenvans CALC ENVRET/10 (ENVRET 10 ENVANS ) BU -e -nenvans CALC 2*ENVBAR+20*(ENVFOO+2) PAGE:17
18 Created By eucalyptus :seiseki.dat 0: () 1: 2: ]:1 1: 2: 3:quickSort 4:Quicksort ]:3 :100 : [~ :5 100 ] (-_-/~~~~~~~~~~~~~~~~~~~~(^^/ seiseki.dat ] Quick Sort D: MT: EN: D MT EN ID MT EN ID MT EN ID MT EN ID MT EN :seiseki.dat [0: () 1: 2: ]:1 [1: 2: 3:quickSort 4:Quicksort ]:3 :30 : [~ :1 30 ] (-_-/~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~(^^/ [ seiseki.dat ] Quick Sort ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN PAGE:18
19 1_0,2_1,23 1_0,2_2,388 1_0,2_3,43 1_0,2_4,56 1_1,2_1,199 1_1,2_2,190 1_1,2_3,86 1_1,2_4,88 1_2,2_1,199 1_2,2_2,208 1_2,2_3,83 1_2,2_4,84 PAGE:19
20 1 [ seiseki.dat ] 588 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN [ seiseki.dat ] 6664 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN QuickSort [ seiseki.dat ] Quick Sort 1160 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN PAGE:20
21 QuickSort [ seiseki.dat ] Quick Sort 1454 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN [ seiseki.dat ] 3518 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN [ seiseki.dat ] 3309 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN PAGE:21
22 QuickSort [ seiseki.dat ] Quick Sort 2068 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN QuickSort [ seiseki.dat ] Quick Sort 2090 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN [ seiseki.dat ] 3513 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN PAGE:22
23 0 [ seiseki.dat ] 3614 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN QuickSort [ seiseki.dat ] Quick Sort 1974 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN QuickSort [ seiseki.dat ] Quick Sort 2002 ID: MT: EN: ID MT EN ID MT EN ID MT EN ID MT EN ID MT EN PAGE:23
24 Factor:IBM PC/AT Compatible OS:MS-Windows98 Compiler:Borland Turbo PASCAL 5.5 Either CMOS-RTC or MHz clock seems strange. factor : : L1 cache size 16KB L2 cache size 64KB L3 cache size 96KB L4 cache size 128KB MMX: CELERON-A [GenuineIntel Fam6 Mdl6 Stp 0] [MHz] [ns/dword] [CPUclocks] E-cache read E-cache write Main read Main write From pfm686 Order SORT_O.PAS QuickSort QuickSort PAGE:24
25 STOP_W.BAT QuickSort QuickSort QuickSort PAGE:25
26 71 QuickSort 7.2QuickSort QuickSort QuickSort PAGE:26
27 order 2 procedure uses PAGE:27
橡挿入法の実践
PAGE:1 7JFC1121 PAGE:2 7JFC1121 PAGE:3 7JFC1121 Kadai_1.pas program input_file;{7jfc1121 19 20 { type item = record id : integer; math : integer; english : integer; var wfile data flag id_no filename :
More informationPascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS Pascal
Pascal Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS 2010 10 1 Pascal 2 1.1.......................... 2 1.2.................. 2 1.3........................ 3 2 4 2.1................................
More informationxl 1 program Othello6; 2 {$APPTYPE CONSOLE} 3 uses SysUtils; 4 5 type 6 TMasuNo = 0..99; // 7 TYouso = (Soto,Kara,Kuro,Siro); // 8 TBan = array [TMasu
xl 1 program Othello6; 2 {$APPTYPE CONSOLE 3 uses SysUtils; 4 5 type 6 TMasuNo = 0..99; // 7 TYouso = (Soto,Kara,Kuro,Siro); // 8 TBan = array [TMasuNo] of TYouso; // 10 10 9 TPlayer = Kuro..Siro; // 10
More informationB Simon (Trump ) SimonU.pas SimonP.dpr Name FormSimon Caption Position podesktopcenter uses Windows, Messages, SysUtils,
B 132 20 1 1 20.1 20.1.1 1 52 10 1 2 3... 7 8 8 8 20.1.2 1 5 6 7 3 20.1.3 1 3 8 20.1.4 13 20.1.5 4 1 (solitaire) B 133 20.2 20.2.1 Simon (Trump ) SimonU.pas SimonP.dpr 20.2.2 Name FormSimon Caption Position
More information2011 D Pascal CASL II ( ) Pascal C 3. A A Pascal TA TA enshu-
2011 D 1 1.1 1.2 Pascal CASL II ( ) Pascal 1. 2011 10 6 2011 2 9 15 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA enshud@fenrir.ics.es.osaka-u.ac.jp TA enshu-d@fenrir.ics.es.osaka-u.ac.jp higo@ist.osaka-u.ac.jp
More information2005 D Pascal CASL ( ) Pascal C 3. A A Pascal TA TA TA
2005 D 1 1.1 1.2 Pascal CASL ( ) Pascal 1. 2005 10 13 2006 1 19 12 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA TA TA sdate@ist.osaka-u.ac.jp nakamoto@image.med.osaka-u.ac.jp h-kido@ist.osaka-u.ac.jp m-nakata@ist.osaka-u.ac.jp
More informationB 90 Canvas.Pen.Width := PenWidth; NewData; (* FormCreate (*********************** ******************* procedure TFormSorting.DrawOne(No : TDat
B 89 14 14.1 14.1.1 SortingU SortingP 14.1.2 Form Name FormSorting Caption Position podesktopcenter 14.1.3 14.1.4 const NoMax = 400; DataMax = 600; PenWidth = 2; type TDataNo = 0..NoMax; TData = array
More information第10回 コーディングと統合(WWW用).PDF
10 January 8, 2004 algorithm algorithm algorithm (unit testing) (integrated testing) (acceptance testing) Big-Bang (incremental development) (goto goto DO 50 I=1,COUNT IF (ERROR1) GO TO 60 IF (ERROR2)
More information2009 D Pascal CASL II ( ) Pascal C 3. A A Pascal TA TA
2009 D 1 1.1 1.2 Pascal CASL II ( ) Pascal 1. 2009 10 15 2010 1 29 16 2. C 3. A A 2 1 2 Pascal 1.3 1. 2. TA enshud@image.med.osaka-u.ac.jp TA enshu-d@image.med.osaka-u.ac.jp nakamoto@image.med.osaka-u.ac.jp
More informationuntitled
II 4 Yacc Lex 2005 : 0 1 Yacc 20 Lex 1 20 traverse 1 %% 2 [0-9]+ { yylval.val = atoi((char*)yytext); return NUM; 3 "+" { return + ; 4 "*" { return * ; 5 "-" { return - ; 6 "/" { return / ; 7 [ \t] { /*
More informationXpressMemoForDash.dvi
Xpress-MP 1 Ver 1.1 2006. 2. 16 (Ver1.0) 2006. 3. 1 (Ver1.1) 1 2006 3 Xpress-MP Xpress-MP 2006 Xpress-MP,. Dash [1]. mosel,, mosel.,,?, shokosv Xpress-MP,., 2. Example. 1 Xpress-MP 2 mosel 3 mosel 4, shakosv
More information基礎情報処理 I (文字型)
プログラミング 1 ( 文字型 ) program character1; a,b,c: char; writeln('1 文字づつ3 文字入力してください :'); readln(a); readln(b); readln(c); write(a); write(b); write(c); writeln; a,b,c:char; a:='a'; b:='b'; c:='c'; write(a);
More informationsyspro-0405.ppt
3 4, 5 1 UNIX csh 2.1 bash X Window 2 grep l POSIX * more POSIX 3 UNIX. 4 first.sh #!bin/sh #first.sh #This file looks through all the files in the current #directory for the string yamada, and then prints
More information橡Pascal-Tの挙動を調べる
PROGRAM SAMPLE01(INPUT, OUTPUT); BEGIN END. PROGRAM SAMPLE02(INPUT, OUTPUT); VAR X, Y, Z : INTEGER; BEGIN X := 1; Y := 2; Z := X + Y; WRITELN(Z); END. #!/usr/local/bin/perl #PASCAL-T OBJECT MAC FILE
More information2004.11.29 4 Communication1 program communication1(input, output); procedure double; r1, r2: real; r2 := 2 * r1; double; end. Communication1 program communication1(input, output); procedure double; r1,
More information1 シミュレーションとは何か?
Delphi P.1/16 Delphi Delphi Object Pascal Delphi Delphi Delphi (Borland) Windows Turbo Pascal Pascal Delphi Turbo Pascal Windows Pascal FORTRAN BASIC Java Algol Algol Pascal Pascal Pascal Pascal Delphi
More informationII ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 D
II 8 2003 11 12 1 6 ( ) prog8-1.c s1542h017%./prog8-1 1 => 35 Hiroshi 2 => 23 Koji 3 => 67 Satoshi 4 => 87 Junko 5 => 64 Ichiro 6 => 89 Mari 7 => 73 Daisuke 8 =>. 73 Daisuke 35 Hiroshi 64 Ichiro 87 Junko
More informationex01.dvi
,. 0. 0.0. C () /******************************* * $Id: ex_0_0.c,v.2 2006-04-0 3:37:00+09 naito Exp $ * * 0. 0.0 *******************************/ #include int main(int argc, char **argv) { double
More informationcompiler-text.dvi
2018.4 1 2 2.1 1 1 1 1: 1. (source program) 2. (object code) 3. 1 2.2 C if while return C input() output() fun var ( ) main() C (C-Prime) C A B C 2.3 Pascal P 1 C LDC load constant LOD load STR store AOP
More information2
Haskell ( ) kazu@iij.ad.jp 1 2 Blub Paul Graham http://practical-scheme.net/trans/beating-the-averages-j.html Blub Blub Blub Blub 3 Haskell Sebastian Sylvan http://www.haskell.org/haskellwiki/why_haskell_matters...
More informationif clear = 1 then Q <= " "; elsif we = 1 then Q <= D; end rtl; regs.vhdl clk 0 1 rst clear we Write Enable we 1 we 0 if clk 1 Q if rst =
VHDL 2 1 VHDL 1 VHDL FPGA VHDL 2 HDL VHDL 2.1 D 1 library ieee; use ieee.std_logic_1164.all; use ieee.std_logic_unsigned.all; regs.vhdl entity regs is clk, rst : in std_logic; clear : in std_logic; we
More information1.ppt
/* * Program name: hello.c */ #include int main() { printf( hello, world\n ); return 0; /* * Program name: Hello.java */ import java.io.*; class Hello { public static void main(string[] arg)
More informationtest.gby
Beautiful Programming Language and Beautiful Testing 1 Haskeller Haskeller 2 Haskeller (Doctest QuickCheck ) github 3 Haskeller 4 Haskell Platform 2011.4.0.0 Glasgow Haskell Compiler + 23 19 8 5 10 5 Q)
More informationL N P Y F C T V W Z I X Pentomino Form Name Caption Position FormMain podesktopcenter
1. 1 1 1.1 5 12 60 3 20 4 15 5 12 6 10 12 L N P Y F C T V W Z I X 1.1.1 1.2 Pentomino 1.2.1 Form Name Caption Position FormMain podesktopcenter 1.2.2 unit PentominoU; interface uses Windows, Messages,
More informationfp.gby
1 1 2 2 3 2 4 5 6 7 8 9 10 11 Haskell 12 13 Haskell 14 15 ( ) 16 ) 30 17 static 18 (IORef) 19 20 OK NG 21 Haskell (+) :: Num a => a -> a -> a sort :: Ord a => [a] -> [a] delete :: Eq a => a -> [a] -> [a]
More informationuntitled
Fortran90 ( ) 17 12 29 1 Fortran90 Fortran90 FORTRAN77 Fortran90 1 Fortran90 module 1.1 Windows Windows UNIX Cygwin (http://www.cygwin.com) C\: Install Cygwin f77 emacs latex ps2eps dvips Fortran90 Intel
More information橡点検記録(集約).PDF
942.8.8.8.7 671 86 11 1 9 9 9 1 1,792 7,23 2,483 1,324 2,198 7,23 82 7,23 6,327 9,22 9,713 8,525 8,554 9,22. 8,554. 1,79 9,713 95 947 8,525.. 944 671 81 7 17 1,29 1,225 1,241 1,25 1,375 9.3 23,264 25,
More information(18,26) 10/ GHz.xls [ (18GHz) ] GHz.xls [ (26GHz) ] +----all.sh [ 2 10 ] +----mesure-ryudai/ / _csv.log [
I 065762A 19.08.19 19.08.24 19.08.20 1 (18,26) 10/ +----18GHz.xls [ (18GHz) ] +----26GHz.xls [ (26GHz) ] +----all.sh [ 2 10 ] +----mesure-ryudai/ +----20070401/ +----192.168.100.9_csv.log [ (18GHz) ] +----192.168.100.11_csv.log
More informationcsj-report.pdf
527 9 CSJ CSJ CSJ 1 8 XML CSJ XML Browser (MonoForC) CSJ 1.7 CSJ CSJ CSJ 9.1 GREP GREP Unix Windows Windows (http://www.vector.co.jp/) Trn Windows Trn > > grep *.trn 528 9 CSJ A01F0132.trn:& A01M0097.trn:&
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A B f : A B 4 (i) f (ii) f (iii) C 2 g, h: C A f g = f h g = h (iv) C 2 g, h: B C g f = h f g = h 4 (1) (i) (iii) (2) (iii) (i) (3) (ii) (iv) (4)
More informationmain.dvi
20 II 7. 1 409, 3255 e-mail: namba@faculty.chiba-u.jp 2 1 1 1 4 2 203 2 1 1 1 5 503 1 3 1 2 2 Web http://www.icsd2.tj.chiba-u.jp/~namba/lecture/ 1 2 1 5 501 1,, \,", 2000 7. : 1 1 CPU CPU 1 Intel Pentium
More informationデザインパフォーマンス向上のためのHDLコーディング法
WP231 (1.1) 2006 1 6 HDL FPGA TL TL 100MHz 400MHz HDL FPGA FPGA 2005 2006 Xilinx, Inc. All rights reserved. XILINX, the Xilinx logo, and other designated brands included herein are trademarks of Xilinx,
More informationCopyright c 2008 Zhenjiang Hu, All Right Reserved.
2008 10 27 Copyright c 2008 Zhenjiang Hu, All Right Reserved. (Bool) True False data Bool = False True Remark: not :: Bool Bool not False = True not True = False (Pattern matching) (Rewriting rules) not
More informationprogram.dvi
2001.06.19 1 programming semi ver.1.0 2001.06.19 1 GA SA 2 A 2.1 valuename = value value name = valuename # ; Fig. 1 #-----GA parameter popsize = 200 mutation rate = 0.01 crossover rate = 1.0 generation
More informationCompiled MODELSでのDFT位相検出装置のモデル化と評価
listsize TPBIG.EXE /Mingw32 ATP (Alternative Transients Program)- EMTP ATP ATP ATP ATP(TPBIG.EXE) EMTP (ATP)FORTAN77 DIMENSION C malloc listsize TACS DIMENSIONEMTP ATP(TPBIG.EXE) listsize (CPU ) RL 4040
More information<リスト1> AD コンバータへのデータの出力例 NEC PC98 用 mov al,22h // CLK -> 1, CS -> 0, DI -> 0 out 32h,al // シリアル ポートにデータ出力 PC/AT 互換機用 mov al,00h // CLK -> 1 mov dx,3fb
AD コンバータへのデータの出力例 NEC PC98 用 mov al,22h // CLK -> 1, CS -> 0, DI -> 0 out 32h,al // シリアル ポートにデータ出力 PC/AT 互換機用 mov al,00h // CLK -> 1 mov dx,3fbh out dx al // シリアル ポートにデータ出力 mov al,03h // CS -> 0,
More informationby CASIO W61CA For Those Requiring an English/Chinese Instruction
by CASIO W61CA http://www.au.kddi.com/torisetsu/index.html http://www.au.kddi.com/manual/index.html For Those Requiring an English/Chinese Instruction Manual English/Chinese Simple Manual can be read on
More information~~~~~~~~~~~~~~~~~~ wait Call CPU time 1, latch: library cache 7, latch: library cache lock 4, job scheduler co
072 DB Magazine 2007 September ~~~~~~~~~~~~~~~~~~ wait Call CPU time 1,055 34.7 latch: library cache 7,278 750 103 24.7 latch: library cache lock 4,194 465 111 15.3 job scheduler coordinator slave wait
More information1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 5 3. 4. 5. A0 (1) A, B A B f K K A ϕ 1, ϕ 2 f ϕ 1 = f ϕ 2 ϕ 1 = ϕ 2 (2) N A 1, A 2, A 3,... N A n X N n X N, A n N n=1 1 A1 d (d 2) A (, k A k = O), A O. f
More informationuntitled
Summer 2008 1 7 12 14 16 16 16 SAS Academic News B-8 4 B-9 6 B-11 7 B-15 10 DATA _NULL_; dlm=","; char1="" char2="" char3="15" char4="a",,15,a results=catx(dlm, OF char1-char4); PUT results; DATA
More informationK227 Java 2
1 K227 Java 2 3 4 5 6 Java 7 class Sample1 { public static void main (String args[]) { System.out.println( Java! ); } } 8 > javac Sample1.java 9 10 > java Sample1 Java 11 12 13 http://java.sun.com/j2se/1.5.0/ja/download.html
More informationhaskell.gby
Haskell 1 2 3 Haskell ( ) 4 Haskell Lisper 5 Haskell = Haskell 6 Haskell Haskell... 7 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 div 2 3 4 map even [1,2,3,4]
More informationn 第1章 章立ての部分は、書式(PC入門大見出し)を使います
FORTRAN FORTRAN FORTRAN ) DO DO IF IF FORTRAN FORTRAN(FORmula TRANslator)1956 IBM FORTRAN IV FORTRAN77 Fortran90 FORTRAN77 FORTRAN FORTARN IF, DO C UNIX FORTRAN PASCAL COBOL PL/I BASIC Lisp PROLOG Lisp
More informationSQUFOF NTT Shanks SQUFOF SQUFOF Pentium III Pentium 4 SQUFOF 2.03 (Pentium 4 2.0GHz Willamette) N UBASIC 50 / 200 [
SQUFOF SQUFOF NTT 2003 2 17 16 60 Shanks SQUFOF SQUFOF Pentium III Pentium 4 SQUFOF 2.03 (Pentium 4 2.0GHz Willamette) 60 1 1.1 N 62 16 24 UBASIC 50 / 200 [ 01] 4 large prime 943 2 1 (%) 57 146 146 15
More information: gettoken(1) module P = Printf exception End_of_system (* *) let _ISTREAM = ref stdin let ch = ref ( ) let read () = (let c =!ch in ch := inp
7 OCaml () 1. 2. () (compiler) (interpreter) 2 OCaml (syntax) (BNF,backus normal form ) 1 + 2; let x be 2-1 in x; ::= ; let be in ; ::= + - ::= * / ::= 7.1 ( (printable characters) (tokens) 1 (lexical
More informationcom.ibm.etools.egl.jsfsearch.tutorial.doc.ps
EGL JSF ii EGL JSF EGL JSF.. 1................. 1 1:.... 3 Web.......... 3........... 3........ 4......... 7 2:...... 7..... 7 SQL.... 8 JSF.... 10 Web.... 12......... 13 3: OR....... 14 OR... 14.15 OR.....
More informationRR-US470 (RQCA1588).indd
RR-US470 Panasonic Corporation 2006 2 3 4 http://www.sense.panasonic.co.jp/ 1 2 3 ( ) ZOOM 5 6 7 8 9 10 4 2 1 3 4 2 3 1 3 11 12 1 4 2 5 3 1 2 13 14 q φ φ 1 2 3 4 3 1 2 3 4 2 3 15 16 1 2 3 [/]p/o 17 1 2
More information¥¤¥ó¥¿¡¼¥Í¥Ã¥È·×¬¤È¥Ç¡¼¥¿²òÀÏ Âè2²ó
2 2015 4 20 1 (4/13) : ruby 2 / 49 2 ( ) : gnuplot 3 / 49 1 1 2014 6 IIJ / 4 / 49 1 ( ) / 5 / 49 ( ) 6 / 49 (summary statistics) : (mean) (median) (mode) : (range) (variance) (standard deviation) 7 / 49
More informationQuick Sort 計算機アルゴリズム特論 :2017 年度 只木進一
Quick Sort 計算機アルゴリズム特論 :2017 年度 只木進一 2 基本的考え方 リスト ( あるいは配列 )SS の中の ある要素 xx(pivot) を選択 xx より小さい要素からなる部分リスト SS 1 xx より大きい要素からなる部分リスト SS 2 xx は SS 1 または SS 2 に含まれる 長さが 1 になるまで繰り返す pivot xx の選び方として 中央の要素を選択すると効率が良い
More informationビットリアカップ2007けいはんなサイクルレースリザルト
Page 4/30 Page 5/30 Page 6/30 Page 7/30 Page 8/30 Page 9/30 Page 10/30 Page 11/30 Page 12/30 Page 13/30 Page 14/30 Page 15/30 Page 16/30 Page 17/30 Page 18/30 Page 19/30 Page 20/30 Page 21/30 Page 22/30
More informationPage 1
Page 1 Page 2 Page 3 Page 4 620 628 579-41 -6.7-49 -7.9 71 41 47-24 -33.3 6 15.9 11.5 6.5 8.1 36 15 22-14 -38.9 7 43.4 Page 5 277 302 23 24 12/3Q 12/4Q 13/1Q 13/2Q 13/3Q 13/4Q 14/1Q 14/2Q 14/3Q 14/4Q 15/1Q
More information# let st1 = {name = "Taro Yamada"; id = };; val st1 : student = {name="taro Yamada"; id=123456} { 1 = 1 ;...; n = n } # let string_of_student {n
II 6 / : 2001 11 21 (OCaml ) 1 (field) name id type # type student = {name : string; id : int};; type student = { name : string; id : int; } student {} type = { 1 : 1 ;...; n : n } { 1 = 1 ;...; n = n
More informationO(N) ( ) log 2 N
2005 11 21 1 1.1 2 O(N) () log 2 N 1.2 2 1 List 3-1 List 3-3 List 3-4? 3 3.1 3.1.1 List 2-1(p.70) 1 1 10 1 3.1.2 List 3-1(p.70-71) 1 1 2 1 2 2 1: 1 3 3.1.3 1 List 3-1(p.70-71) 2 #include stdlib.h
More informationPBASIC 2.5 PBASIC 2.5 $PBASIC directive PIN type New DEBUG control characters DEBUGIN Line continuation for comma-delimited lists IF THEN ELSE * SELEC
PBASIC 2.5 PBASIC 2.5 BASIC Stamp Editor / Development System Version 2.0 Beta Release 2 2.0 PBASIC BASIC StampR PBASIC PBASIC PBASIC 2.5 Parallax, Inc. PBASIC 2.5 PBASIC 2.5 support@microbot-ed.com 1
More informationPR300 電力モニタ 通信インタフェース (RS-485通信,Ethernet通信)
User s Manual 1 2 3 1 2 3 Ethernet 1 2 3 4 Ethernet (ST-NO) (PCLK1) (PCLK2) (COMM) (M ASC) (M RTU) (M TCP) (RS-485) (B-RT) (PR201) (NONE) (PRI) (EVEN) (ODD) (STP) (DLN) (RS-485) (Ethernet) (IP-1)
More information. (.8.). t + t m ü(t + t) + c u(t + t) + k u(t + t) = f(t + t) () m ü f. () c u k u t + t u Taylor t 3 u(t + t) = u(t) + t! u(t) + ( t)! = u(t) + t u(
3 8. (.8.)............................................................................................3.............................................4 Nermark β..........................................
More information橡Taro9-生徒の活動.PDF
3 1 4 1 20 30 2 2 3-1- 1 2-2- -3- 18 1200 1 4-4- -5- 15 5 25 5-6- 1 4 2 1 10 20 2 3-7- 1 2 3 150 431 338-8- 2 3 100 4 5 6 7 1-9- 1291-10 - -11 - 10 1 35 2 3 1866 68 4 1871 1873 5 6-12 - 1 2 3 4 1 4-13
More informationnum2.dvi
kanenko@mbk.nifty.com http://kanenko.a.la9.jp/ 16 32...... h 0 h = ε () 0 ( ) 0 1 IEEE754 (ieee754.c Kerosoft Ltd.!) 1 2 : OS! : WindowsXP ( ) : X Window xcalc.. (,.) C double 10,??? 3 :, ( ) : BASIC,
More informationMicrosoft Word - Live Meeting Help.docx
131011 101919 161719 19191110191914 11191417 101919 1915101919 Microsoft Office Live Meeting 2007 191714191412 1913191919 12 151019121914 19151819171912 17191012151911 17181219 1610121914 19121117 12191517
More informationPage 1 of 6 B (The World of Mathematics) November 20, 2006 Final Exam 2006 Division: ID#: Name: 1. p, q, r (Let p, q, r are propositions. ) (10pts) (a
Page 1 of 6 B (The World of Mathematics) November 0, 006 Final Exam 006 Division: ID#: Name: 1. p, q, r (Let p, q, r are propositions. ) (a) (Decide whether the following holds by completing the truth
More information() / (front end) (back end) (phase) (pass) 1 2
1 () () lex http://www.cs.info.mie-u.ac.jp/~toshi/lectures/compiler/ 2018 4 1 () / (front end) (back end) (phase) (pass) 1 2 () () var left, right; fun int main() { left = 0; right = 10; return ((left
More information</ul> (XXX ) 15 ( )15 35 (XXX ) 15 ( ) [4] HTML HTML HTML HTML 1. <!--- CONTENTS_TITLE_TABLE ---> <b><font size=+1>xxx </font></b> <sm
1. 1 2006 9 5 AWK HTML 2 1 [4] AWK Yahoo! : http://headlines.yahoo.co.jp/hl HTML HTML [4] HTML HTML ( ) HTML 3 2 Yahoo! Yahoo! ( ) (XXX ) - 15 ( )15 35
More information22nd Embarcadero Developer Camp G6
17 Th Developer Camp ライトニングトーク WMI を もっと使おう! 株式会社シリアルゲームズ 取締役細川淳 1 WMI? WMI とは Windows Management Instrumentation の略 Windows Driver Model の拡張の一種 Windows が管理する情報へのインターフェース 例えば CPU の情報であったり 物理ハードディスクの情報などなどが取れます
More information_IMv2.key
飯島基 文 customb2b@me.com $ ssh ladmin@im.example.com $ cd /Library/Server/Web/Data/Sites/Default/ $ git clone https://github.com/msyk/inter-mediator.git
More information120802_MPI.ppt
CPU CPU CPU CPU CPU SMP Symmetric MultiProcessing CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU CP OpenMP MPI MPI CPU CPU CPU CPU CPU CPU CPU CPU CPU CPU MPI MPI+OpenMP CPU CPU CPU CPU CPU CPU CPU CP
More information11042 計算機言語7回目 サポートページ:
11042 7 :https://goo.gl/678wgm November 27, 2017 10/2 1(print, ) 10/16 2(2, ) 10/23 (3 ) 10/31( ),11/6 (4 ) 11/13,, 1 (5 6 ) 11/20,, 2 (5 6 ) 11/27 (7 12/4 (9 ) 12/11 1 (10 ) 12/18 2 (10 ) 12/25 3 (11
More informationfiš„v3.dvi
(2001) 49 2 261 275 Web 1 1 2001 2 21 2001 4 26 Windows OS Web Windows OS, DELPHI, 1. Windows OS. DELPHI Web DELPHI ALGOL PASCAL VISUAL BASIC C++ JAVA DELPHI Windows OS Linux OS KyLix Mac OS (ver 10) JAVA
More information消火まえがき.qxd
119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 1100 1200 1300 1400 1500 1600 1700 1800 1900 2000 2100 1032MHz 1489MHz 1895MHz 2150MHz 142 143 144 145 146 147
More informationTheRecordx.indd
March 2015 Contents 2/2-13 2/12 THE RECORD 2015-03 2 focus 3 THE RECORD 2015 03 THE RECORD 2015 03 4 focus 5 THE RECORD 2015 03 THE RECORD 2015 03 6 01 02 03 04 05 06 07 08 7 THE RECORD 2015 03 09 10 11
More informationI J
I 065763J 8 7 7 31 jikken/ +----- accumulation_demupa.c +----- accumulation_rain.c +----- frequency_demupa.c +----- frequency_rain.c +----- go.sh +----- graph_maker.sh +----- mesure-ryudai/ 2007/4/1 2007/6/30
More informationコンピュータ工学講義プリント (7 月 17 日 ) 今回の講義では フローチャートについて学ぶ フローチャートとはフローチャートは コンピュータプログラムの処理の流れを視覚的に表し 処理の全体像を把握しやすくするために書く図である 日本語では流れ図という 図 1 は ユーザーに 0 以上の整数 n
コンピュータ工学講義プリント (7 月 17 日 ) 今回の講義では フローチャートについて学ぶ フローチャートとはフローチャートは コンピュータプログラムの処理の流れを視覚的に表し 処理の全体像を把握しやすくするために書く図である 日本語では流れ図という 図 1 は ユーザーに 0 以上の整数 n を入力してもらい その後 1 から n までの全ての整数の合計 sum を計算し 最後にその sum
More informationuntitled
CA Easytrieve CA Technologies CA Easytrieve P 3 7 P 8 30 16 DB2 IMS IMS ADABAS JCL OS 2 Copyright 2012 CA. All rights reserved. CA Easytrieve CA Easytrieve CA Easytrieve CA Easytrieve COBOL,PL/I 3 Copyright
More informationサービス付き高齢者向け住宅賠償責任保険.indd
1 2 1 CASE 1 1 2 CASE 2 CASE 3 CASE 4 3 CASE 5 4 3 4 5 6 2 CASE 1 CASE 2 CASE 3 7 8 3 9 10 CASE 1 CASE 2 CASE 3 CASE 4 11 12 13 14 1 1 2 FAX:03-3375-8470 2 3 3 4 4 3 15 16 FAX:03-3375-8470 1 2 0570-022808
More information1 1 2 2 2-1 2 2-2 4 2-3 11 2-4 12 2-5 14 3 16 3-1 16 3-2 18 3-3 22 4 35 4-1 VHDL 35 4-2 VHDL 37 4-3 VHDL 37 4-3-1 37 4-3-2 42 i
1030195 15 2 10 1 1 2 2 2-1 2 2-2 4 2-3 11 2-4 12 2-5 14 3 16 3-1 16 3-2 18 3-3 22 4 35 4-1 VHDL 35 4-2 VHDL 37 4-3 VHDL 37 4-3-1 37 4-3-2 42 i 4-3-3 47 5 52 53 54 55 ii 1 VHDL IC VHDL 5 2 3 IC 4 5 1 2
More information1. COBOL COBOL COBOL COBOL 2
2003-6-24 COBOL COBOL 2002 ISO/IEC JTC 1/SC 22/WG 4 (COBOL) INCITS J4 (COBOL) SC 22/COBOL WG COBOL JIS 1 1. COBOL 2. 2002 COBOL 3. 2002 COBOL 4. 5. COBOL 2 1. COBOL 3 COBOL COBOL Java C C++ 200 100 100
More information45 VBA Fortran, Pascal, C Windows OS Excel VBA Visual Basic Excel VBA VBA Visual Basic For Application Microsoft Office Office Excel VBA VBA Excel Acc
\n Title 文 系 学 生 のための VBA プログラミング 教 育 についての 考 察 Author(s) 五 月 女, 仁 子 ; Soutome, Hiroko Citation 商 経 論 叢, 46(1): 45-60 Date 2010-10-31 Type Departmental Bulletin Paper Rights publisher KANAGAWA University
More informationonly my information
1 only my information 2010 17 Special thanks 17 2006 2010 60 90 A4 2 1 1 CD 2 3 A B A B A 1/4 B B 3/4 1. 2. A 3 A 3. B 3 B http://www.edu.c.utokyo.ac.jp/edu/information.html only my information 2 2006
More information18/02/18 14:39 PAGE : : : : : : : : :
18/02/18 14:39 PAGE-1 1 84 3:37.84 2 79 3:43.24 3 83 3:45.45 4 51 3:45.52 5 69 3:50.18 6 85 3:50.88 7 68 3:54.57 8 67 3:56.56 9 73 4:00.78 10 38 4:00.97 11 82 4:01.65 12 32 4:04.21 13 80 4:04.89 14 29
More informationAJAN IO制御コマンド コマンドリファレンス
- 1 - Interface Corporation 1 3 2 4 2.1...4 2.2...8 2.3...9 2.4...19 2.5...20 3 21 3.1...21 3.2...23 3.3...24 3.4...28 3.5...29 30 31 Interface Corporation - 2 - 1 AJANI/O Linux Web site GPG-2000 http://www.interface.co.jp/catalog/soft/prdc_soft_all.asp?name=gpg-2000
More informationパズルをSugar制約ソルバーで解く
Sugar 1 2 3 1 CSPSAT 2008 8 21 Sugar 1 2 3 Sugar Sugar (CSP) (SAT ) (encode) SAT SAT order encoding direct encoding support encoding http://bachistckobe-uacjp/sugar/ Web Sugar 1 2 3 Sugar SAT (COP) MAX-CSP
More information- 1 - - 0.5%5 10 10 5 10 1 5 1
- - - 1 - - 0.5%5 10 10 5 10 1 5 1 - 2 - - - - A B A A A B A B B A - 3 - - 100 100 100 - A) ( ) B) A) A B A B 110 A B 13 - 4 - A) 36 - - - 5 - - 1 - 6-1 - 7 - - 8 - Q.15 0% 10% 20% 30% 40% 50% 60% 70%
More information橡WINAPLI.PDF
Windows Visual Basic 2.0 8 7 29 8 2 Windows 1. Windows 1 1.1. Windows 1 1.2. 1 2. Visual Basic 2 2.1. VisualBasic 2 2.2. Visual Basic 2 2.2.1. 2 2.2.2. 2 2.2.3. 2 2.2.4. 2 2.2.5. 2 2.3. Visual Basic 3
More informationI I / 47
1 2013.07.18 1 I 2013 3 I 2013.07.18 1 / 47 A Flat MPI B 1 2 C: 2 I 2013.07.18 2 / 47 I 2013.07.18 3 / 47 #PJM -L "rscgrp=small" π-computer small: 12 large: 84 school: 24 84 16 = 1344 small school small
More information-2 gnuplot( ) j ( ) gnuplot /shell/myscript 1
-2 gnuplot( ) j 2006 05 03 2006 05 12 2006 05 09 2 ( ) gnuplot /shell/myscript 1 1 shell script Level 1 myls #!/bin/sh # nowdir= pwd # if [ -f $1 -o -z $1 ] ; then echo "Enter pass" echo "ex) myls.sh./"
More information