0c813d9382995b2752c2a3f0136da5614d98541b
3 private int int_array
[];
4 private int array_size
;
5 private int current_size
;
7 private void setSize(int size
) {
11 private int getSize() {
15 private void setCurrentSize(int index
) {
19 private int getCurrentSize() {
24 int_array
= new int[size
];
29 public boolean inserer(int value
) {
31 System
.out
.println("Tableau plein");
34 int pos
= binarySearch(0, getCurrentSize(), value
);
37 System
.out
.println("Valeur à inserer déjà présente");
41 for (i
= getCurrentSize() - 1; (i
>= 0 && int_array
[i
] > value
); i
--) {
42 int_array
[i
+ 1] = int_array
[i
];
44 int_array
[i
+ 1] = value
;
49 private int binarySearch(int first
, int last
, int value
) {
52 int middle
= (first
+ last
) / 2;
53 if (value
== int_array
[middle
])
55 if (value
> int_array
[middle
])
56 return binarySearch((middle
+ 1), last
, value
);
57 return binarySearch(first
, (middle
-1), value
);
60 public boolean supprimer(int value
) {
62 System
.out
.println("Aucune valeur à supprimer");
66 // Find position of element to be deleted
67 int pos
= binarySearch(0, getCurrentSize(), value
);
71 System
.out
.println("Valeur à supprimer inexistante");
76 for (int i
= pos
; i
< getCurrentSize() - 1; i
++) {
77 int_array
[i
] = int_array
[i
+ 1];
84 private boolean is_full() {
85 return (getCurrentSize() >= getSize());
88 private boolean is_empty() {
89 return (getCurrentSize() == 0);
92 public void afficher() {
93 for (int i
= 0; i
< getSize(); i
++) {
94 System
.out
.println("element " + i
+ " " + int_array
[i
]);
98 public static void main(String
[] args
) {
99 Entiers integer
= new Entiers(5);
119 integer
.supprimer(12);
122 System
.out
.println("Current size " + integer
.getCurrentSize());
124 integer
.supprimer(1);
127 System
.out
.println("Current size " + integer
.getCurrentSize());