7251eb5f7d87b9a2e3cb51c7508ae2ad77b0c029
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");
39 for (int i
= 0; i
< getCurrentSize(); i
++) {
40 if (int_array
[i
] == value
) {
42 } else if (int_array
[i
] > value
) {
43 for (int j
= getCurrentSize(); j
> i
; j
--) {
44 int_array
[j
] = int_array
[j
- 1];
53 * The current value to add is > to all elements in the tab.
54 * So add it at the end.
56 int_array
[getCurrentSize()] = value
;
61 private int binarySearch(int first
, int last
, int value
) {
64 int middle
= (first
+ last
) / 2;
65 if (value
== int_array
[middle
])
67 else if (value
> int_array
[middle
])
68 return binarySearch((middle
+ 1), last
, value
);
69 return binarySearch(first
, (middle
-1), value
);
72 public boolean supprimer(int value
) {
74 System
.out
.println("Aucune valeur à supprimer");
78 for (int i
= 0; i
< getCurrentSize(); i
++) {
79 if (int_array
[i
] == value
) {
80 // Deleting the element in the tab
81 for (int j
= i
; j
< getCurrentSize() - 1; j
++) {
82 int_array
[j
] = int_array
[j
+ 1];
91 private boolean isFull() {
92 return (getCurrentSize() >= getSize());
95 private boolean isEmpty() {
96 return (getCurrentSize() == 0);
99 public void afficher() {
100 System
.out
.println("----");
101 for (int i
= 0; i
< getSize(); i
++) {
102 System
.out
.println("element " + i
+ " " + int_array
[i
]);
106 public static void main(String
[] args
) {
107 Entiers integer
= new Entiers(5);
127 integer
.supprimer(12);
130 System
.out
.println("Current size " + integer
.getCurrentSize());
132 integer
.supprimer(1);
135 System
.out
.println("Current size " + integer
.getCurrentSize());